./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.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/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.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 96fefa83b30613ea39cc46bf8d68e79f92b274b671b8c94e773ac8e262712116 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:38:47,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:38:47,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:38:47,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:38:47,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:38:47,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:38:47,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:38:47,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:38:47,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:38:47,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:38:47,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:38:47,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:38:47,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:38:47,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:38:47,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:38:47,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:38:47,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:38:47,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:38:47,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:38:47,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:38:47,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:38:47,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:38:47,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:38:47,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:38:47,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:38:47,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:38:47,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:38:47,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:38:47,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:38:47,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:38:47,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:38:47,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:38:47,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:38:47,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:38:47,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:38:47,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:38:47,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:38:47,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:38:47,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:38:47,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:38:47,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:38:47,870 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:38:47,899 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:38:47,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:38:47,900 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:38:47,901 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:38:47,901 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:38:47,902 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:38:47,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:38:47,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:38:47,902 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:38:47,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:38:47,903 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:38:47,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:38:47,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:38:47,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:38:47,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:38:47,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:38:47,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:38:47,905 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:38:47,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:38:47,905 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:38:47,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:38:47,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:38:47,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:38:47,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:38:47,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:47,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:38:47,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:38:47,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:38:47,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:38:47,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:38:47,908 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:38:47,908 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:38:47,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:38:47,909 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 -> 96fefa83b30613ea39cc46bf8d68e79f92b274b671b8c94e773ac8e262712116 [2022-02-20 18:38:48,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:38:48,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:38:48,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:38:48,166 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:38:48,166 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:38:48,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:38:48,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18bcdb550/2305e752b1244896ad1fd263a98e16d0/FLAG696254811 [2022-02-20 18:38:48,629 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:38:48,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:38:48,639 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18bcdb550/2305e752b1244896ad1fd263a98e16d0/FLAG696254811 [2022-02-20 18:38:49,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18bcdb550/2305e752b1244896ad1fd263a98e16d0 [2022-02-20 18:38:49,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:38:49,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:38:49,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:49,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:38:49,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:38:49,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:49" (1/1) ... [2022-02-20 18:38:49,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643e7f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:49, skipping insertion in model container [2022-02-20 18:38:49,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:49" (1/1) ... [2022-02-20 18:38:49,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:38:49,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:38:49,278 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/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7235,7248] [2022-02-20 18:38:49,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:49,329 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:38:49,378 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/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7235,7248] [2022-02-20 18:38:49,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:49,412 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:38:49,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:49 WrapperNode [2022-02-20 18:38:49,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:49,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:49,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:38:49,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:38:49,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:49" (1/1) ... [2022-02-20 18:38:49,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:49" (1/1) ... [2022-02-20 18:38:49,503 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 588 [2022-02-20 18:38:49,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:49,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:38:49,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:38:49,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:38:49,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:49" (1/1) ... [2022-02-20 18:38:49,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:49" (1/1) ... [2022-02-20 18:38:49,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:49" (1/1) ... [2022-02-20 18:38:49,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:49" (1/1) ... [2022-02-20 18:38:49,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:49" (1/1) ... [2022-02-20 18:38:49,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:49" (1/1) ... [2022-02-20 18:38:49,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:49" (1/1) ... [2022-02-20 18:38:49,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:38:49,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:38:49,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:38:49,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:38:49,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:49" (1/1) ... [2022-02-20 18:38:49,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:49,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:38:49,608 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 18:38:49,619 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 18:38:49,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:38:49,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:38:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:38:49,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:38:49,726 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:38:49,728 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:38:50,432 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:38:50,443 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:38:50,443 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:38:50,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:50 BoogieIcfgContainer [2022-02-20 18:38:50,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:38:50,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:38:50,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:38:50,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:38:50,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:38:49" (1/3) ... [2022-02-20 18:38:50,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fe9d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:50, skipping insertion in model container [2022-02-20 18:38:50,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:49" (2/3) ... [2022-02-20 18:38:50,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fe9d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:50, skipping insertion in model container [2022-02-20 18:38:50,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:50" (3/3) ... [2022-02-20 18:38:50,456 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:38:50,462 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:38:50,463 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:38:50,518 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:38:50,526 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 18:38:50,526 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:38:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 134 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:38:50,576 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:50,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:50,578 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:50,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:50,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1933157835, now seen corresponding path program 1 times [2022-02-20 18:38:50,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:50,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687488830] [2022-02-20 18:38:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:51,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {138#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1780~0 := 0;~__return_1911~0 := 0;~__return_2009~0 := 0; {138#true} is VALID [2022-02-20 18:38:51,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {138#true} is VALID [2022-02-20 18:38:51,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {138#true} is VALID [2022-02-20 18:38:51,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {138#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {138#true} is VALID [2022-02-20 18:38:51,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {138#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {138#true} is VALID [2022-02-20 18:38:51,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {138#true} is VALID [2022-02-20 18:38:51,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {138#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {138#true} is VALID [2022-02-20 18:38:51,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {138#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {138#true} is VALID [2022-02-20 18:38:51,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {138#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {138#true} is VALID [2022-02-20 18:38:51,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {138#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {138#true} is VALID [2022-02-20 18:38:51,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {138#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {138#true} is VALID [2022-02-20 18:38:51,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {138#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {138#true} is VALID [2022-02-20 18:38:51,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {138#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {138#true} is VALID [2022-02-20 18:38:51,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {138#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {138#true} is VALID [2022-02-20 18:38:51,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {138#true} assume ~id1~0 != ~id2~0; {138#true} is VALID [2022-02-20 18:38:51,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {138#true} assume ~id1~0 != ~id3~0; {138#true} is VALID [2022-02-20 18:38:51,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {138#true} assume ~id2~0 != ~id3~0; {138#true} is VALID [2022-02-20 18:38:51,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {138#true} assume ~id1~0 >= 0; {138#true} is VALID [2022-02-20 18:38:51,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {138#true} assume ~id2~0 >= 0; {138#true} is VALID [2022-02-20 18:38:51,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {138#true} assume ~id3~0 >= 0; {138#true} is VALID [2022-02-20 18:38:51,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {138#true} assume 0 == ~r1~0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {140#(<= ~r1~0 0)} assume 0 == ~r2~0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {140#(<= ~r1~0 0)} assume 0 == ~r3~0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {140#(<= ~r1~0 0)} assume !(0 == main_~init__r122~0#1 % 256); {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {140#(<= ~r1~0 0)} assume !(0 == main_~init__r132~0#1 % 256); {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {140#(<= ~r1~0 0)} assume !(0 == main_~init__r212~0#1 % 256); {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {140#(<= ~r1~0 0)} assume !(0 == main_~init__r232~0#1 % 256); {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {140#(<= ~r1~0 0)} assume !(0 == main_~init__r312~0#1 % 256); {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {140#(<= ~r1~0 0)} assume !(0 == main_~init__r322~0#1 % 256); {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {140#(<= ~r1~0 0)} assume ~max1~0 == ~id1~0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {140#(<= ~r1~0 0)} assume ~max2~0 == ~id2~0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {140#(<= ~r1~0 0)} assume ~max3~0 == ~id3~0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {140#(<= ~r1~0 0)} assume 0 == ~st1~0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {140#(<= ~r1~0 0)} assume 0 == ~st2~0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {140#(<= ~r1~0 0)} assume 0 == ~st3~0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {140#(<= ~r1~0 0)} assume 0 == ~nl1~0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {140#(<= ~r1~0 0)} assume 0 == ~nl2~0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {140#(<= ~r1~0 0)} assume 0 == ~nl3~0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {140#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {140#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {140#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1780~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1780~0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {140#(<= ~r1~0 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {140#(<= ~r1~0 0)} assume main_~main__i2~0#1 < 6; {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,040 INFO L290 TraceCheckUtils]: 43: Hoare triple {140#(<= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256); {140#(<= ~r1~0 0)} is VALID [2022-02-20 18:38:51,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {140#(<= ~r1~0 0)} assume !(~r1~0 < 2); {139#false} is VALID [2022-02-20 18:38:51,041 INFO L290 TraceCheckUtils]: 45: Hoare triple {139#false} ~mode1~0 := 1; {139#false} is VALID [2022-02-20 18:38:51,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {139#false} assume !!(0 == ~mode2~0 % 256); {139#false} is VALID [2022-02-20 18:38:51,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {139#false} assume !(~r2~0 < 2); {139#false} is VALID [2022-02-20 18:38:51,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {139#false} ~mode2~0 := 1; {139#false} is VALID [2022-02-20 18:38:51,047 INFO L290 TraceCheckUtils]: 49: Hoare triple {139#false} assume !!(0 == ~mode3~0 % 256); {139#false} is VALID [2022-02-20 18:38:51,047 INFO L290 TraceCheckUtils]: 50: Hoare triple {139#false} assume !(~r3~0 < 2); {139#false} is VALID [2022-02-20 18:38:51,048 INFO L290 TraceCheckUtils]: 51: Hoare triple {139#false} ~mode3~0 := 1; {139#false} is VALID [2022-02-20 18:38:51,048 INFO L290 TraceCheckUtils]: 52: Hoare triple {139#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {139#false} is VALID [2022-02-20 18:38:51,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {139#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {139#false} is VALID [2022-02-20 18:38:51,050 INFO L290 TraceCheckUtils]: 54: Hoare triple {139#false} ~__return_1911~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1911~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {139#false} is VALID [2022-02-20 18:38:51,050 INFO L290 TraceCheckUtils]: 55: Hoare triple {139#false} assume 0 == main_~assert__arg~0#1 % 256; {139#false} is VALID [2022-02-20 18:38:51,051 INFO L290 TraceCheckUtils]: 56: Hoare triple {139#false} assume !false; {139#false} is VALID [2022-02-20 18:38:51,053 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 18:38:51,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:51,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687488830] [2022-02-20 18:38:51,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687488830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:51,054 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:51,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:51,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472768976] [2022-02-20 18:38:51,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:51,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:38:51,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:51,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:51,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:51,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:51,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:51,154 INFO L87 Difference]: Start difference. First operand has 135 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 134 states have internal predecessors, (236), 0 states have call successors, (0), 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 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:51,601 INFO L93 Difference]: Finished difference Result 288 states and 491 transitions. [2022-02-20 18:38:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:51,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:38:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2022-02-20 18:38:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2022-02-20 18:38:51,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 491 transitions. [2022-02-20 18:38:52,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:52,069 INFO L225 Difference]: With dead ends: 288 [2022-02-20 18:38:52,069 INFO L226 Difference]: Without dead ends: 201 [2022-02-20 18:38:52,072 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 18:38:52,076 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 131 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:52,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 412 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-02-20 18:38:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2022-02-20 18:38:52,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:52,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 199 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 198 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:52,134 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 199 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 198 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:52,135 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 199 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 198 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:52,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:52,150 INFO L93 Difference]: Finished difference Result 201 states and 314 transitions. [2022-02-20 18:38:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 314 transitions. [2022-02-20 18:38:52,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:52,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:52,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 198 states have internal predecessors, (313), 0 states have call successors, (0), 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 201 states. [2022-02-20 18:38:52,153 INFO L87 Difference]: Start difference. First operand has 199 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 198 states have internal predecessors, (313), 0 states have call successors, (0), 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 201 states. [2022-02-20 18:38:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:52,161 INFO L93 Difference]: Finished difference Result 201 states and 314 transitions. [2022-02-20 18:38:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 314 transitions. [2022-02-20 18:38:52,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:52,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:52,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:52,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 198 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 313 transitions. [2022-02-20 18:38:52,173 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 313 transitions. Word has length 57 [2022-02-20 18:38:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:52,174 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 313 transitions. [2022-02-20 18:38:52,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 313 transitions. [2022-02-20 18:38:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:38:52,176 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:52,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:52,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:38:52,177 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:52,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:52,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1883490782, now seen corresponding path program 1 times [2022-02-20 18:38:52,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:52,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213940656] [2022-02-20 18:38:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:52,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {1216#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1780~0 := 0;~__return_1911~0 := 0;~__return_2009~0 := 0; {1216#true} is VALID [2022-02-20 18:38:52,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {1216#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {1216#true} is VALID [2022-02-20 18:38:52,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {1216#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1216#true} is VALID [2022-02-20 18:38:52,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {1216#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1216#true} is VALID [2022-02-20 18:38:52,273 INFO L290 TraceCheckUtils]: 4: Hoare triple {1216#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1216#true} is VALID [2022-02-20 18:38:52,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {1216#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1216#true} is VALID [2022-02-20 18:38:52,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {1216#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1216#true} is VALID [2022-02-20 18:38:52,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {1216#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1216#true} is VALID [2022-02-20 18:38:52,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {1216#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1216#true} is VALID [2022-02-20 18:38:52,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {1216#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1216#true} is VALID [2022-02-20 18:38:52,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {1216#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1216#true} is VALID [2022-02-20 18:38:52,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {1216#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1216#true} is VALID [2022-02-20 18:38:52,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1216#true} is VALID [2022-02-20 18:38:52,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {1216#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1216#true} is VALID [2022-02-20 18:38:52,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {1216#true} assume ~id1~0 != ~id2~0; {1216#true} is VALID [2022-02-20 18:38:52,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {1216#true} assume ~id1~0 != ~id3~0; {1216#true} is VALID [2022-02-20 18:38:52,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {1216#true} assume ~id2~0 != ~id3~0; {1216#true} is VALID [2022-02-20 18:38:52,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {1216#true} assume ~id1~0 >= 0; {1216#true} is VALID [2022-02-20 18:38:52,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {1216#true} assume ~id2~0 >= 0; {1216#true} is VALID [2022-02-20 18:38:52,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {1216#true} assume ~id3~0 >= 0; {1216#true} is VALID [2022-02-20 18:38:52,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {1216#true} assume 0 == ~r1~0; {1216#true} is VALID [2022-02-20 18:38:52,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {1216#true} assume 0 == ~r2~0; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {1218#(<= ~r2~0 0)} assume 0 == ~r3~0; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {1218#(<= ~r2~0 0)} assume !(0 == main_~init__r122~0#1 % 256); {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {1218#(<= ~r2~0 0)} assume !(0 == main_~init__r132~0#1 % 256); {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {1218#(<= ~r2~0 0)} assume !(0 == main_~init__r212~0#1 % 256); {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {1218#(<= ~r2~0 0)} assume !(0 == main_~init__r232~0#1 % 256); {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {1218#(<= ~r2~0 0)} assume !(0 == main_~init__r312~0#1 % 256); {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {1218#(<= ~r2~0 0)} assume !(0 == main_~init__r322~0#1 % 256); {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {1218#(<= ~r2~0 0)} assume ~max1~0 == ~id1~0; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {1218#(<= ~r2~0 0)} assume ~max2~0 == ~id2~0; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {1218#(<= ~r2~0 0)} assume ~max3~0 == ~id3~0; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {1218#(<= ~r2~0 0)} assume 0 == ~st1~0; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {1218#(<= ~r2~0 0)} assume 0 == ~st2~0; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {1218#(<= ~r2~0 0)} assume 0 == ~st3~0; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {1218#(<= ~r2~0 0)} assume 0 == ~nl1~0; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {1218#(<= ~r2~0 0)} assume 0 == ~nl2~0; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {1218#(<= ~r2~0 0)} assume 0 == ~nl3~0; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {1218#(<= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {1218#(<= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,286 INFO L290 TraceCheckUtils]: 40: Hoare triple {1218#(<= ~r2~0 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1780~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1780~0; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {1218#(<= ~r2~0 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {1218#(<= ~r2~0 0)} assume main_~main__i2~0#1 < 6; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {1218#(<= ~r2~0 0)} assume !!(0 == ~mode1~0 % 256); {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,288 INFO L290 TraceCheckUtils]: 44: Hoare triple {1218#(<= ~r2~0 0)} assume ~r1~0 < 2; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,288 INFO L290 TraceCheckUtils]: 45: Hoare triple {1218#(<= ~r2~0 0)} assume !!(0 == ~ep12~0 % 256); {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,289 INFO L290 TraceCheckUtils]: 46: Hoare triple {1218#(<= ~r2~0 0)} assume !!(0 == ~ep13~0 % 256); {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,289 INFO L290 TraceCheckUtils]: 47: Hoare triple {1218#(<= ~r2~0 0)} ~mode1~0 := 1; {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,289 INFO L290 TraceCheckUtils]: 48: Hoare triple {1218#(<= ~r2~0 0)} assume !!(0 == ~mode2~0 % 256); {1218#(<= ~r2~0 0)} is VALID [2022-02-20 18:38:52,290 INFO L290 TraceCheckUtils]: 49: Hoare triple {1218#(<= ~r2~0 0)} assume !(~r2~0 < 2); {1217#false} is VALID [2022-02-20 18:38:52,290 INFO L290 TraceCheckUtils]: 50: Hoare triple {1217#false} ~mode2~0 := 1; {1217#false} is VALID [2022-02-20 18:38:52,290 INFO L290 TraceCheckUtils]: 51: Hoare triple {1217#false} assume !!(0 == ~mode3~0 % 256); {1217#false} is VALID [2022-02-20 18:38:52,291 INFO L290 TraceCheckUtils]: 52: Hoare triple {1217#false} assume !(~r3~0 < 2); {1217#false} is VALID [2022-02-20 18:38:52,291 INFO L290 TraceCheckUtils]: 53: Hoare triple {1217#false} ~mode3~0 := 1; {1217#false} is VALID [2022-02-20 18:38:52,291 INFO L290 TraceCheckUtils]: 54: Hoare triple {1217#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1217#false} is VALID [2022-02-20 18:38:52,291 INFO L290 TraceCheckUtils]: 55: Hoare triple {1217#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1217#false} is VALID [2022-02-20 18:38:52,292 INFO L290 TraceCheckUtils]: 56: Hoare triple {1217#false} ~__return_1911~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1911~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1217#false} is VALID [2022-02-20 18:38:52,292 INFO L290 TraceCheckUtils]: 57: Hoare triple {1217#false} assume 0 == main_~assert__arg~0#1 % 256; {1217#false} is VALID [2022-02-20 18:38:52,292 INFO L290 TraceCheckUtils]: 58: Hoare triple {1217#false} assume !false; {1217#false} is VALID [2022-02-20 18:38:52,293 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 18:38:52,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:52,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213940656] [2022-02-20 18:38:52,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213940656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:52,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:52,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:52,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813752430] [2022-02-20 18:38:52,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:52,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:38:52,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:52,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:52,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:52,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:52,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:52,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:52,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:52,340 INFO L87 Difference]: Start difference. First operand 199 states and 313 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:52,677 INFO L93 Difference]: Finished difference Result 475 states and 769 transitions. [2022-02-20 18:38:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:52,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:38:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2022-02-20 18:38:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2022-02-20 18:38:52,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 455 transitions. [2022-02-20 18:38:53,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:53,048 INFO L225 Difference]: With dead ends: 475 [2022-02-20 18:38:53,054 INFO L226 Difference]: Without dead ends: 330 [2022-02-20 18:38:53,058 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 18:38:53,060 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 110 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:53,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 442 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:53,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-02-20 18:38:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2022-02-20 18:38:53,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:53,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 328 states, 327 states have (on average 1.6055045871559632) internal successors, (525), 327 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,141 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 328 states, 327 states have (on average 1.6055045871559632) internal successors, (525), 327 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,142 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 328 states, 327 states have (on average 1.6055045871559632) internal successors, (525), 327 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:53,153 INFO L93 Difference]: Finished difference Result 330 states and 526 transitions. [2022-02-20 18:38:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 526 transitions. [2022-02-20 18:38:53,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:53,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:53,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 328 states, 327 states have (on average 1.6055045871559632) internal successors, (525), 327 states have internal predecessors, (525), 0 states have call successors, (0), 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 330 states. [2022-02-20 18:38:53,156 INFO L87 Difference]: Start difference. First operand has 328 states, 327 states have (on average 1.6055045871559632) internal successors, (525), 327 states have internal predecessors, (525), 0 states have call successors, (0), 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 330 states. [2022-02-20 18:38:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:53,169 INFO L93 Difference]: Finished difference Result 330 states and 526 transitions. [2022-02-20 18:38:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 526 transitions. [2022-02-20 18:38:53,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:53,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:53,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:53,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.6055045871559632) internal successors, (525), 327 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 525 transitions. [2022-02-20 18:38:53,184 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 525 transitions. Word has length 59 [2022-02-20 18:38:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:53,185 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 525 transitions. [2022-02-20 18:38:53,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 525 transitions. [2022-02-20 18:38:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:38:53,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:53,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:53,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:38:53,187 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:53,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash -111872728, now seen corresponding path program 1 times [2022-02-20 18:38:53,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:53,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315415911] [2022-02-20 18:38:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:53,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:53,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {3019#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1780~0 := 0;~__return_1911~0 := 0;~__return_2009~0 := 0; {3019#true} is VALID [2022-02-20 18:38:53,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {3019#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {3019#true} is VALID [2022-02-20 18:38:53,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {3019#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {3019#true} is VALID [2022-02-20 18:38:53,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {3019#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {3019#true} is VALID [2022-02-20 18:38:53,278 INFO L290 TraceCheckUtils]: 4: Hoare triple {3019#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {3019#true} is VALID [2022-02-20 18:38:53,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {3019#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {3019#true} is VALID [2022-02-20 18:38:53,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {3019#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {3019#true} is VALID [2022-02-20 18:38:53,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {3019#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {3019#true} is VALID [2022-02-20 18:38:53,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {3019#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {3019#true} is VALID [2022-02-20 18:38:53,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {3019#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {3019#true} is VALID [2022-02-20 18:38:53,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {3019#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {3019#true} is VALID [2022-02-20 18:38:53,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {3019#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {3019#true} is VALID [2022-02-20 18:38:53,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {3019#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {3019#true} is VALID [2022-02-20 18:38:53,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {3019#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {3019#true} is VALID [2022-02-20 18:38:53,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {3019#true} assume ~id1~0 != ~id2~0; {3019#true} is VALID [2022-02-20 18:38:53,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {3019#true} assume ~id1~0 != ~id3~0; {3019#true} is VALID [2022-02-20 18:38:53,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {3019#true} assume ~id2~0 != ~id3~0; {3019#true} is VALID [2022-02-20 18:38:53,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {3019#true} assume ~id1~0 >= 0; {3019#true} is VALID [2022-02-20 18:38:53,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {3019#true} assume ~id2~0 >= 0; {3019#true} is VALID [2022-02-20 18:38:53,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {3019#true} assume ~id3~0 >= 0; {3019#true} is VALID [2022-02-20 18:38:53,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {3019#true} assume 0 == ~r1~0; {3019#true} is VALID [2022-02-20 18:38:53,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {3019#true} assume 0 == ~r2~0; {3019#true} is VALID [2022-02-20 18:38:53,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {3019#true} assume 0 == ~r3~0; {3019#true} is VALID [2022-02-20 18:38:53,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {3019#true} assume !(0 == main_~init__r122~0#1 % 256); {3019#true} is VALID [2022-02-20 18:38:53,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {3019#true} assume !(0 == main_~init__r132~0#1 % 256); {3019#true} is VALID [2022-02-20 18:38:53,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {3019#true} assume !(0 == main_~init__r212~0#1 % 256); {3019#true} is VALID [2022-02-20 18:38:53,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {3019#true} assume !(0 == main_~init__r232~0#1 % 256); {3019#true} is VALID [2022-02-20 18:38:53,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {3019#true} assume !(0 == main_~init__r312~0#1 % 256); {3019#true} is VALID [2022-02-20 18:38:53,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {3019#true} assume !(0 == main_~init__r322~0#1 % 256); {3019#true} is VALID [2022-02-20 18:38:53,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {3019#true} assume ~max1~0 == ~id1~0; {3019#true} is VALID [2022-02-20 18:38:53,282 INFO L290 TraceCheckUtils]: 30: Hoare triple {3019#true} assume ~max2~0 == ~id2~0; {3019#true} is VALID [2022-02-20 18:38:53,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {3019#true} assume ~max3~0 == ~id3~0; {3019#true} is VALID [2022-02-20 18:38:53,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {3019#true} assume 0 == ~st1~0; {3019#true} is VALID [2022-02-20 18:38:53,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {3019#true} assume 0 == ~st2~0; {3019#true} is VALID [2022-02-20 18:38:53,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {3019#true} assume 0 == ~st3~0; {3019#true} is VALID [2022-02-20 18:38:53,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {3019#true} assume 0 == ~nl1~0; {3019#true} is VALID [2022-02-20 18:38:53,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {3019#true} assume 0 == ~nl2~0; {3019#true} is VALID [2022-02-20 18:38:53,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {3019#true} assume 0 == ~nl3~0; {3019#true} is VALID [2022-02-20 18:38:53,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {3019#true} assume 0 == ~mode1~0 % 256; {3019#true} is VALID [2022-02-20 18:38:53,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {3019#true} assume 0 == ~mode2~0 % 256; {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:53,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1780~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1780~0; {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:53,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:53,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 6; {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:53,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:53,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 < 2; {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:53,288 INFO L290 TraceCheckUtils]: 45: Hoare triple {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep12~0 % 256); {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:53,288 INFO L290 TraceCheckUtils]: 46: Hoare triple {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep13~0 % 256); {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:53,289 INFO L290 TraceCheckUtils]: 47: Hoare triple {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:38:53,290 INFO L290 TraceCheckUtils]: 48: Hoare triple {3021#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {3020#false} is VALID [2022-02-20 18:38:53,290 INFO L290 TraceCheckUtils]: 49: Hoare triple {3020#false} assume !!(0 == ~ep12~0 % 256); {3020#false} is VALID [2022-02-20 18:38:53,290 INFO L290 TraceCheckUtils]: 50: Hoare triple {3020#false} assume !!(0 == ~ep32~0 % 256); {3020#false} is VALID [2022-02-20 18:38:53,290 INFO L290 TraceCheckUtils]: 51: Hoare triple {3020#false} assume !(2 == ~r2~0); {3020#false} is VALID [2022-02-20 18:38:53,290 INFO L290 TraceCheckUtils]: 52: Hoare triple {3020#false} ~mode2~0 := 0; {3020#false} is VALID [2022-02-20 18:38:53,291 INFO L290 TraceCheckUtils]: 53: Hoare triple {3020#false} assume !!(0 == ~mode3~0 % 256); {3020#false} is VALID [2022-02-20 18:38:53,291 INFO L290 TraceCheckUtils]: 54: Hoare triple {3020#false} assume !(~r3~0 < 2); {3020#false} is VALID [2022-02-20 18:38:53,291 INFO L290 TraceCheckUtils]: 55: Hoare triple {3020#false} ~mode3~0 := 1; {3020#false} is VALID [2022-02-20 18:38:53,291 INFO L290 TraceCheckUtils]: 56: Hoare triple {3020#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3020#false} is VALID [2022-02-20 18:38:53,291 INFO L290 TraceCheckUtils]: 57: Hoare triple {3020#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {3020#false} is VALID [2022-02-20 18:38:53,291 INFO L290 TraceCheckUtils]: 58: Hoare triple {3020#false} ~__return_1911~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1911~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {3020#false} is VALID [2022-02-20 18:38:53,292 INFO L290 TraceCheckUtils]: 59: Hoare triple {3020#false} assume 0 == main_~assert__arg~0#1 % 256; {3020#false} is VALID [2022-02-20 18:38:53,292 INFO L290 TraceCheckUtils]: 60: Hoare triple {3020#false} assume !false; {3020#false} is VALID [2022-02-20 18:38:53,292 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 18:38:53,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:53,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315415911] [2022-02-20 18:38:53,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315415911] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:53,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:53,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:53,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815762272] [2022-02-20 18:38:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:53,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:38:53,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:53,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:53,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:53,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:53,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:53,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:53,337 INFO L87 Difference]: Start difference. First operand 328 states and 525 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:53,729 INFO L93 Difference]: Finished difference Result 603 states and 981 transitions. [2022-02-20 18:38:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:53,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:38:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-02-20 18:38:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-02-20 18:38:53,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 436 transitions. [2022-02-20 18:38:54,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:54,076 INFO L225 Difference]: With dead ends: 603 [2022-02-20 18:38:54,076 INFO L226 Difference]: Without dead ends: 458 [2022-02-20 18:38:54,077 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 18:38:54,078 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 111 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:54,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 444 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-02-20 18:38:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2022-02-20 18:38:54,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:54,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 458 states. Second operand has 456 states, 455 states have (on average 1.6153846153846154) internal successors, (735), 455 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:54,179 INFO L74 IsIncluded]: Start isIncluded. First operand 458 states. Second operand has 456 states, 455 states have (on average 1.6153846153846154) internal successors, (735), 455 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:54,180 INFO L87 Difference]: Start difference. First operand 458 states. Second operand has 456 states, 455 states have (on average 1.6153846153846154) internal successors, (735), 455 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:54,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:54,198 INFO L93 Difference]: Finished difference Result 458 states and 736 transitions. [2022-02-20 18:38:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 736 transitions. [2022-02-20 18:38:54,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:54,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:54,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 456 states, 455 states have (on average 1.6153846153846154) internal successors, (735), 455 states have internal predecessors, (735), 0 states have call successors, (0), 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 458 states. [2022-02-20 18:38:54,212 INFO L87 Difference]: Start difference. First operand has 456 states, 455 states have (on average 1.6153846153846154) internal successors, (735), 455 states have internal predecessors, (735), 0 states have call successors, (0), 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 458 states. [2022-02-20 18:38:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:54,234 INFO L93 Difference]: Finished difference Result 458 states and 736 transitions. [2022-02-20 18:38:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 736 transitions. [2022-02-20 18:38:54,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:54,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:54,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:54,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.6153846153846154) internal successors, (735), 455 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:54,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 735 transitions. [2022-02-20 18:38:54,254 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 735 transitions. Word has length 61 [2022-02-20 18:38:54,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:54,254 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 735 transitions. [2022-02-20 18:38:54,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:54,254 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 735 transitions. [2022-02-20 18:38:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:38:54,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:54,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:54,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:38:54,256 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:54,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:54,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1275396395, now seen corresponding path program 1 times [2022-02-20 18:38:54,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:54,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966101719] [2022-02-20 18:38:54,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:54,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:54,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {5456#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1780~0 := 0;~__return_1911~0 := 0;~__return_2009~0 := 0; {5456#true} is VALID [2022-02-20 18:38:54,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {5456#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {5456#true} is VALID [2022-02-20 18:38:54,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {5456#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {5456#true} is VALID [2022-02-20 18:38:54,358 INFO L290 TraceCheckUtils]: 3: Hoare triple {5456#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {5456#true} is VALID [2022-02-20 18:38:54,358 INFO L290 TraceCheckUtils]: 4: Hoare triple {5456#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {5456#true} is VALID [2022-02-20 18:38:54,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {5456#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {5456#true} is VALID [2022-02-20 18:38:54,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {5456#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {5456#true} is VALID [2022-02-20 18:38:54,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {5456#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {5456#true} is VALID [2022-02-20 18:38:54,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {5456#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {5456#true} is VALID [2022-02-20 18:38:54,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {5456#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {5456#true} is VALID [2022-02-20 18:38:54,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {5456#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {5456#true} is VALID [2022-02-20 18:38:54,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {5456#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {5456#true} is VALID [2022-02-20 18:38:54,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {5456#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {5456#true} is VALID [2022-02-20 18:38:54,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {5456#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {5456#true} is VALID [2022-02-20 18:38:54,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {5456#true} assume ~id1~0 != ~id2~0; {5456#true} is VALID [2022-02-20 18:38:54,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {5456#true} assume ~id1~0 != ~id3~0; {5456#true} is VALID [2022-02-20 18:38:54,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {5456#true} assume ~id2~0 != ~id3~0; {5456#true} is VALID [2022-02-20 18:38:54,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {5456#true} assume ~id1~0 >= 0; {5456#true} is VALID [2022-02-20 18:38:54,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {5456#true} assume ~id2~0 >= 0; {5456#true} is VALID [2022-02-20 18:38:54,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {5456#true} assume ~id3~0 >= 0; {5456#true} is VALID [2022-02-20 18:38:54,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {5456#true} assume 0 == ~r1~0; {5456#true} is VALID [2022-02-20 18:38:54,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {5456#true} assume 0 == ~r2~0; {5456#true} is VALID [2022-02-20 18:38:54,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {5456#true} assume 0 == ~r3~0; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {5458#(<= ~r3~0 0)} assume !(0 == main_~init__r122~0#1 % 256); {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {5458#(<= ~r3~0 0)} assume !(0 == main_~init__r132~0#1 % 256); {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {5458#(<= ~r3~0 0)} assume !(0 == main_~init__r212~0#1 % 256); {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {5458#(<= ~r3~0 0)} assume !(0 == main_~init__r232~0#1 % 256); {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {5458#(<= ~r3~0 0)} assume !(0 == main_~init__r312~0#1 % 256); {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {5458#(<= ~r3~0 0)} assume !(0 == main_~init__r322~0#1 % 256); {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {5458#(<= ~r3~0 0)} assume ~max1~0 == ~id1~0; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {5458#(<= ~r3~0 0)} assume ~max2~0 == ~id2~0; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {5458#(<= ~r3~0 0)} assume ~max3~0 == ~id3~0; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {5458#(<= ~r3~0 0)} assume 0 == ~st1~0; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {5458#(<= ~r3~0 0)} assume 0 == ~st2~0; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {5458#(<= ~r3~0 0)} assume 0 == ~st3~0; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {5458#(<= ~r3~0 0)} assume 0 == ~nl1~0; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {5458#(<= ~r3~0 0)} assume 0 == ~nl2~0; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {5458#(<= ~r3~0 0)} assume 0 == ~nl3~0; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {5458#(<= ~r3~0 0)} assume 0 == ~mode1~0 % 256; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {5458#(<= ~r3~0 0)} assume 0 == ~mode2~0 % 256; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {5458#(<= ~r3~0 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1780~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1780~0; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {5458#(<= ~r3~0 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {5458#(<= ~r3~0 0)} assume main_~main__i2~0#1 < 6; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {5458#(<= ~r3~0 0)} assume !!(0 == ~mode1~0 % 256); {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {5458#(<= ~r3~0 0)} assume ~r1~0 < 2; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {5458#(<= ~r3~0 0)} assume !!(0 == ~ep12~0 % 256); {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {5458#(<= ~r3~0 0)} assume !!(0 == ~ep13~0 % 256); {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {5458#(<= ~r3~0 0)} ~mode1~0 := 1; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,372 INFO L290 TraceCheckUtils]: 48: Hoare triple {5458#(<= ~r3~0 0)} assume !!(0 == ~mode2~0 % 256); {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,372 INFO L290 TraceCheckUtils]: 49: Hoare triple {5458#(<= ~r3~0 0)} assume ~r2~0 < 2; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,372 INFO L290 TraceCheckUtils]: 50: Hoare triple {5458#(<= ~r3~0 0)} assume !!(0 == ~ep21~0 % 256); {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,373 INFO L290 TraceCheckUtils]: 51: Hoare triple {5458#(<= ~r3~0 0)} assume !!(0 == ~ep23~0 % 256); {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,373 INFO L290 TraceCheckUtils]: 52: Hoare triple {5458#(<= ~r3~0 0)} ~mode2~0 := 1; {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,373 INFO L290 TraceCheckUtils]: 53: Hoare triple {5458#(<= ~r3~0 0)} assume !!(0 == ~mode3~0 % 256); {5458#(<= ~r3~0 0)} is VALID [2022-02-20 18:38:54,374 INFO L290 TraceCheckUtils]: 54: Hoare triple {5458#(<= ~r3~0 0)} assume !(~r3~0 < 2); {5457#false} is VALID [2022-02-20 18:38:54,374 INFO L290 TraceCheckUtils]: 55: Hoare triple {5457#false} ~mode3~0 := 1; {5457#false} is VALID [2022-02-20 18:38:54,374 INFO L290 TraceCheckUtils]: 56: Hoare triple {5457#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {5457#false} is VALID [2022-02-20 18:38:54,374 INFO L290 TraceCheckUtils]: 57: Hoare triple {5457#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {5457#false} is VALID [2022-02-20 18:38:54,375 INFO L290 TraceCheckUtils]: 58: Hoare triple {5457#false} ~__return_1911~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1911~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {5457#false} is VALID [2022-02-20 18:38:54,375 INFO L290 TraceCheckUtils]: 59: Hoare triple {5457#false} assume 0 == main_~assert__arg~0#1 % 256; {5457#false} is VALID [2022-02-20 18:38:54,375 INFO L290 TraceCheckUtils]: 60: Hoare triple {5457#false} assume !false; {5457#false} is VALID [2022-02-20 18:38:54,375 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 18:38:54,376 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:54,376 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966101719] [2022-02-20 18:38:54,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966101719] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:54,376 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:54,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:54,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313494965] [2022-02-20 18:38:54,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:54,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:38:54,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:54,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:54,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:54,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:54,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:54,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:54,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:54,419 INFO L87 Difference]: Start difference. First operand 456 states and 735 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:55,030 INFO L93 Difference]: Finished difference Result 1172 states and 1911 transitions. [2022-02-20 18:38:55,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:55,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:38:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2022-02-20 18:38:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2022-02-20 18:38:55,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 455 transitions. [2022-02-20 18:38:55,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:55,361 INFO L225 Difference]: With dead ends: 1172 [2022-02-20 18:38:55,361 INFO L226 Difference]: Without dead ends: 793 [2022-02-20 18:38:55,363 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 18:38:55,364 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 105 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:55,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 380 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2022-02-20 18:38:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2022-02-20 18:38:55,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:55,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 793 states. Second operand has 791 states, 790 states have (on average 1.6164556962025316) internal successors, (1277), 790 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:55,599 INFO L74 IsIncluded]: Start isIncluded. First operand 793 states. Second operand has 791 states, 790 states have (on average 1.6164556962025316) internal successors, (1277), 790 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:55,601 INFO L87 Difference]: Start difference. First operand 793 states. Second operand has 791 states, 790 states have (on average 1.6164556962025316) internal successors, (1277), 790 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:55,636 INFO L93 Difference]: Finished difference Result 793 states and 1278 transitions. [2022-02-20 18:38:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1278 transitions. [2022-02-20 18:38:55,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:55,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:55,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 791 states, 790 states have (on average 1.6164556962025316) internal successors, (1277), 790 states have internal predecessors, (1277), 0 states have call successors, (0), 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 793 states. [2022-02-20 18:38:55,642 INFO L87 Difference]: Start difference. First operand has 791 states, 790 states have (on average 1.6164556962025316) internal successors, (1277), 790 states have internal predecessors, (1277), 0 states have call successors, (0), 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 793 states. [2022-02-20 18:38:55,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:55,676 INFO L93 Difference]: Finished difference Result 793 states and 1278 transitions. [2022-02-20 18:38:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1278 transitions. [2022-02-20 18:38:55,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:55,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:55,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:55,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 1.6164556962025316) internal successors, (1277), 790 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1277 transitions. [2022-02-20 18:38:55,725 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1277 transitions. Word has length 61 [2022-02-20 18:38:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:55,725 INFO L470 AbstractCegarLoop]: Abstraction has 791 states and 1277 transitions. [2022-02-20 18:38:55,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:55,726 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1277 transitions. [2022-02-20 18:38:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:38:55,727 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:55,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:55,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:38:55,727 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:55,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:55,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1280827262, now seen corresponding path program 1 times [2022-02-20 18:38:55,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:55,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876188277] [2022-02-20 18:38:55,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:55,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:55,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {9895#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1780~0 := 0;~__return_1911~0 := 0;~__return_2009~0 := 0; {9895#true} is VALID [2022-02-20 18:38:55,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {9895#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {9895#true} is VALID [2022-02-20 18:38:55,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {9895#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {9895#true} is VALID [2022-02-20 18:38:55,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {9895#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {9895#true} is VALID [2022-02-20 18:38:55,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {9895#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {9895#true} is VALID [2022-02-20 18:38:55,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {9895#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {9895#true} is VALID [2022-02-20 18:38:55,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {9895#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {9895#true} is VALID [2022-02-20 18:38:55,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {9895#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {9895#true} is VALID [2022-02-20 18:38:55,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {9895#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {9895#true} is VALID [2022-02-20 18:38:55,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {9895#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {9895#true} is VALID [2022-02-20 18:38:55,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {9895#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {9895#true} is VALID [2022-02-20 18:38:55,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {9895#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {9895#true} is VALID [2022-02-20 18:38:55,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {9895#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {9895#true} is VALID [2022-02-20 18:38:55,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {9895#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {9895#true} is VALID [2022-02-20 18:38:55,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {9895#true} assume ~id1~0 != ~id2~0; {9895#true} is VALID [2022-02-20 18:38:55,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {9895#true} assume ~id1~0 != ~id3~0; {9895#true} is VALID [2022-02-20 18:38:55,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {9895#true} assume ~id2~0 != ~id3~0; {9895#true} is VALID [2022-02-20 18:38:55,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {9895#true} assume ~id1~0 >= 0; {9895#true} is VALID [2022-02-20 18:38:55,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {9895#true} assume ~id2~0 >= 0; {9895#true} is VALID [2022-02-20 18:38:55,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {9895#true} assume ~id3~0 >= 0; {9895#true} is VALID [2022-02-20 18:38:55,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {9895#true} assume 0 == ~r1~0; {9895#true} is VALID [2022-02-20 18:38:55,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {9895#true} assume 0 == ~r2~0; {9895#true} is VALID [2022-02-20 18:38:55,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {9895#true} assume 0 == ~r3~0; {9895#true} is VALID [2022-02-20 18:38:55,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {9895#true} assume !(0 == main_~init__r122~0#1 % 256); {9895#true} is VALID [2022-02-20 18:38:55,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {9895#true} assume !(0 == main_~init__r132~0#1 % 256); {9895#true} is VALID [2022-02-20 18:38:55,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {9895#true} assume !(0 == main_~init__r212~0#1 % 256); {9895#true} is VALID [2022-02-20 18:38:55,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {9895#true} assume !(0 == main_~init__r232~0#1 % 256); {9895#true} is VALID [2022-02-20 18:38:55,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {9895#true} assume !(0 == main_~init__r312~0#1 % 256); {9895#true} is VALID [2022-02-20 18:38:55,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {9895#true} assume !(0 == main_~init__r322~0#1 % 256); {9895#true} is VALID [2022-02-20 18:38:55,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {9895#true} assume ~max1~0 == ~id1~0; {9895#true} is VALID [2022-02-20 18:38:55,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {9895#true} assume ~max2~0 == ~id2~0; {9895#true} is VALID [2022-02-20 18:38:55,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {9895#true} assume ~max3~0 == ~id3~0; {9895#true} is VALID [2022-02-20 18:38:55,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {9895#true} assume 0 == ~st1~0; {9897#(<= ~st1~0 0)} is VALID [2022-02-20 18:38:55,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {9897#(<= ~st1~0 0)} assume 0 == ~st2~0; {9898#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {9898#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,819 INFO L290 TraceCheckUtils]: 36: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,820 INFO L290 TraceCheckUtils]: 39: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,820 INFO L290 TraceCheckUtils]: 40: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1780~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1780~0; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,821 INFO L290 TraceCheckUtils]: 42: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 2; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,822 INFO L290 TraceCheckUtils]: 45: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 < 2; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,825 INFO L290 TraceCheckUtils]: 54: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 < 2; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,825 INFO L290 TraceCheckUtils]: 55: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,825 INFO L290 TraceCheckUtils]: 56: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,826 INFO L290 TraceCheckUtils]: 57: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,826 INFO L290 TraceCheckUtils]: 58: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:38:55,827 INFO L290 TraceCheckUtils]: 59: Hoare triple {9899#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {9896#false} is VALID [2022-02-20 18:38:55,827 INFO L290 TraceCheckUtils]: 60: Hoare triple {9896#false} ~__return_1911~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1911~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {9896#false} is VALID [2022-02-20 18:38:55,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {9896#false} assume 0 == main_~assert__arg~0#1 % 256; {9896#false} is VALID [2022-02-20 18:38:55,827 INFO L290 TraceCheckUtils]: 62: Hoare triple {9896#false} assume !false; {9896#false} is VALID [2022-02-20 18:38:55,828 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 18:38:55,828 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:55,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876188277] [2022-02-20 18:38:55,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876188277] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:55,828 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:55,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:38:55,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802543528] [2022-02-20 18:38:55,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:55,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:38:55,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:55,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:55,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:55,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:38:55,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:55,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:38:55,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:55,871 INFO L87 Difference]: Start difference. First operand 791 states and 1277 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:59,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:59,305 INFO L93 Difference]: Finished difference Result 3568 states and 5888 transitions. [2022-02-20 18:38:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:38:59,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:38:59,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 996 transitions. [2022-02-20 18:38:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:38:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 996 transitions. [2022-02-20 18:38:59,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 996 transitions. [2022-02-20 18:39:00,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 996 edges. 996 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:00,393 INFO L225 Difference]: With dead ends: 3568 [2022-02-20 18:39:00,393 INFO L226 Difference]: Without dead ends: 2854 [2022-02-20 18:39:00,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:39:00,396 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 881 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:00,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [881 Valid, 1260 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:39:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2022-02-20 18:39:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 1432. [2022-02-20 18:39:01,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:01,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2854 states. Second operand has 1432 states, 1431 states have (on average 1.623340321453529) internal successors, (2323), 1431 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:01,539 INFO L74 IsIncluded]: Start isIncluded. First operand 2854 states. Second operand has 1432 states, 1431 states have (on average 1.623340321453529) internal successors, (2323), 1431 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:01,541 INFO L87 Difference]: Start difference. First operand 2854 states. Second operand has 1432 states, 1431 states have (on average 1.623340321453529) internal successors, (2323), 1431 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:01,881 INFO L93 Difference]: Finished difference Result 2854 states and 4677 transitions. [2022-02-20 18:39:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 4677 transitions. [2022-02-20 18:39:01,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:01,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:01,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 1432 states, 1431 states have (on average 1.623340321453529) internal successors, (2323), 1431 states have internal predecessors, (2323), 0 states have call successors, (0), 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 2854 states. [2022-02-20 18:39:01,891 INFO L87 Difference]: Start difference. First operand has 1432 states, 1431 states have (on average 1.623340321453529) internal successors, (2323), 1431 states have internal predecessors, (2323), 0 states have call successors, (0), 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 2854 states. [2022-02-20 18:39:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:02,237 INFO L93 Difference]: Finished difference Result 2854 states and 4677 transitions. [2022-02-20 18:39:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 4677 transitions. [2022-02-20 18:39:02,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:02,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:02,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:02,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 1.623340321453529) internal successors, (2323), 1431 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2323 transitions. [2022-02-20 18:39:02,393 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2323 transitions. Word has length 63 [2022-02-20 18:39:02,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:02,393 INFO L470 AbstractCegarLoop]: Abstraction has 1432 states and 2323 transitions. [2022-02-20 18:39:02,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2323 transitions. [2022-02-20 18:39:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:39:02,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:02,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:02,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:39:02,395 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1113443658, now seen corresponding path program 1 times [2022-02-20 18:39:02,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:02,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412133765] [2022-02-20 18:39:02,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:02,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {22910#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1780~0 := 0;~__return_1911~0 := 0;~__return_2009~0 := 0; {22910#true} is VALID [2022-02-20 18:39:02,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {22910#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {22910#true} is VALID [2022-02-20 18:39:02,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {22910#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {22910#true} is VALID [2022-02-20 18:39:02,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {22910#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {22910#true} is VALID [2022-02-20 18:39:02,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {22910#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {22910#true} is VALID [2022-02-20 18:39:02,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {22910#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {22910#true} is VALID [2022-02-20 18:39:02,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {22910#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {22910#true} is VALID [2022-02-20 18:39:02,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {22910#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {22910#true} is VALID [2022-02-20 18:39:02,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {22910#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {22910#true} is VALID [2022-02-20 18:39:02,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {22910#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {22910#true} is VALID [2022-02-20 18:39:02,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {22910#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {22910#true} is VALID [2022-02-20 18:39:02,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {22910#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {22910#true} is VALID [2022-02-20 18:39:02,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {22910#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {22910#true} is VALID [2022-02-20 18:39:02,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {22910#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {22910#true} is VALID [2022-02-20 18:39:02,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {22910#true} assume ~id1~0 != ~id2~0; {22910#true} is VALID [2022-02-20 18:39:02,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {22910#true} assume ~id1~0 != ~id3~0; {22910#true} is VALID [2022-02-20 18:39:02,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {22910#true} assume ~id2~0 != ~id3~0; {22910#true} is VALID [2022-02-20 18:39:02,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {22910#true} assume ~id1~0 >= 0; {22910#true} is VALID [2022-02-20 18:39:02,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {22910#true} assume ~id2~0 >= 0; {22910#true} is VALID [2022-02-20 18:39:02,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {22910#true} assume ~id3~0 >= 0; {22910#true} is VALID [2022-02-20 18:39:02,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {22910#true} assume 0 == ~r1~0; {22910#true} is VALID [2022-02-20 18:39:02,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {22910#true} assume 0 == ~r2~0; {22910#true} is VALID [2022-02-20 18:39:02,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {22910#true} assume 0 == ~r3~0; {22910#true} is VALID [2022-02-20 18:39:02,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {22910#true} assume !(0 == main_~init__r122~0#1 % 256); {22910#true} is VALID [2022-02-20 18:39:02,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {22910#true} assume !(0 == main_~init__r132~0#1 % 256); {22910#true} is VALID [2022-02-20 18:39:02,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {22910#true} assume !(0 == main_~init__r212~0#1 % 256); {22910#true} is VALID [2022-02-20 18:39:02,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {22910#true} assume !(0 == main_~init__r232~0#1 % 256); {22910#true} is VALID [2022-02-20 18:39:02,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {22910#true} assume !(0 == main_~init__r312~0#1 % 256); {22910#true} is VALID [2022-02-20 18:39:02,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {22910#true} assume !(0 == main_~init__r322~0#1 % 256); {22910#true} is VALID [2022-02-20 18:39:02,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {22910#true} assume ~max1~0 == ~id1~0; {22910#true} is VALID [2022-02-20 18:39:02,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {22910#true} assume ~max2~0 == ~id2~0; {22910#true} is VALID [2022-02-20 18:39:02,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {22910#true} assume ~max3~0 == ~id3~0; {22910#true} is VALID [2022-02-20 18:39:02,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {22910#true} assume 0 == ~st1~0; {22912#(<= ~st1~0 0)} is VALID [2022-02-20 18:39:02,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {22912#(<= ~st1~0 0)} assume 0 == ~st2~0; {22912#(<= ~st1~0 0)} is VALID [2022-02-20 18:39:02,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {22912#(<= ~st1~0 0)} assume 0 == ~st3~0; {22912#(<= ~st1~0 0)} is VALID [2022-02-20 18:39:02,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {22912#(<= ~st1~0 0)} assume 0 == ~nl1~0; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1780~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1780~0; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,486 INFO L290 TraceCheckUtils]: 41: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,486 INFO L290 TraceCheckUtils]: 42: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,486 INFO L290 TraceCheckUtils]: 43: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,487 INFO L290 TraceCheckUtils]: 44: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 < 2; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,493 INFO L290 TraceCheckUtils]: 47: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 < 2; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,494 INFO L290 TraceCheckUtils]: 50: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,495 INFO L290 TraceCheckUtils]: 51: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,496 INFO L290 TraceCheckUtils]: 54: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 < 2; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,496 INFO L290 TraceCheckUtils]: 55: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,497 INFO L290 TraceCheckUtils]: 56: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,497 INFO L290 TraceCheckUtils]: 57: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {22913#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:02,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {22913#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);main_~check__tmp~0#1 := 0; {22911#false} is VALID [2022-02-20 18:39:02,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {22911#false} ~__return_1911~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1911~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {22911#false} is VALID [2022-02-20 18:39:02,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {22911#false} assume 0 == main_~assert__arg~0#1 % 256; {22911#false} is VALID [2022-02-20 18:39:02,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {22911#false} assume !false; {22911#false} is VALID [2022-02-20 18:39:02,504 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 18:39:02,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:02,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412133765] [2022-02-20 18:39:02,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412133765] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:02,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:02,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:39:02,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927084139] [2022-02-20 18:39:02,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:02,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:39:02,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:02,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:02,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:02,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:39:02,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:02,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:39:02,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:39:02,556 INFO L87 Difference]: Start difference. First operand 1432 states and 2323 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:05,915 INFO L93 Difference]: Finished difference Result 4199 states and 6910 transitions. [2022-02-20 18:39:05,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:05,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:39:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 600 transitions. [2022-02-20 18:39:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 600 transitions. [2022-02-20 18:39:05,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 600 transitions. [2022-02-20 18:39:06,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 600 edges. 600 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:06,564 INFO L225 Difference]: With dead ends: 4199 [2022-02-20 18:39:06,564 INFO L226 Difference]: Without dead ends: 2846 [2022-02-20 18:39:06,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:06,567 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 379 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:06,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 674 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:06,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2022-02-20 18:39:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2127. [2022-02-20 18:39:08,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:08,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2846 states. Second operand has 2127 states, 2126 states have (on average 1.6302916274694261) internal successors, (3466), 2126 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:08,280 INFO L74 IsIncluded]: Start isIncluded. First operand 2846 states. Second operand has 2127 states, 2126 states have (on average 1.6302916274694261) internal successors, (3466), 2126 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:08,284 INFO L87 Difference]: Start difference. First operand 2846 states. Second operand has 2127 states, 2126 states have (on average 1.6302916274694261) internal successors, (3466), 2126 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:08,606 INFO L93 Difference]: Finished difference Result 2846 states and 4675 transitions. [2022-02-20 18:39:08,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 4675 transitions. [2022-02-20 18:39:08,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:08,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:08,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 2127 states, 2126 states have (on average 1.6302916274694261) internal successors, (3466), 2126 states have internal predecessors, (3466), 0 states have call successors, (0), 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 2846 states. [2022-02-20 18:39:08,621 INFO L87 Difference]: Start difference. First operand has 2127 states, 2126 states have (on average 1.6302916274694261) internal successors, (3466), 2126 states have internal predecessors, (3466), 0 states have call successors, (0), 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 2846 states. [2022-02-20 18:39:08,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:08,882 INFO L93 Difference]: Finished difference Result 2846 states and 4675 transitions. [2022-02-20 18:39:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 4675 transitions. [2022-02-20 18:39:08,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:08,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:08,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:08,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 2126 states have (on average 1.6302916274694261) internal successors, (3466), 2126 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 3466 transitions. [2022-02-20 18:39:09,089 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 3466 transitions. Word has length 64 [2022-02-20 18:39:09,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:09,090 INFO L470 AbstractCegarLoop]: Abstraction has 2127 states and 3466 transitions. [2022-02-20 18:39:09,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 3466 transitions. [2022-02-20 18:39:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:39:09,091 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:09,091 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:09,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:39:09,092 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1248232611, now seen corresponding path program 1 times [2022-02-20 18:39:09,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:09,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585453730] [2022-02-20 18:39:09,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:09,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {37849#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1780~0 := 0;~__return_1911~0 := 0;~__return_2009~0 := 0; {37849#true} is VALID [2022-02-20 18:39:09,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {37849#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {37849#true} is VALID [2022-02-20 18:39:09,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {37849#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {37849#true} is VALID [2022-02-20 18:39:09,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {37849#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {37849#true} is VALID [2022-02-20 18:39:09,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {37849#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {37849#true} is VALID [2022-02-20 18:39:09,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {37849#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {37849#true} is VALID [2022-02-20 18:39:09,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {37849#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {37849#true} is VALID [2022-02-20 18:39:09,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {37849#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {37849#true} is VALID [2022-02-20 18:39:09,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {37849#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {37849#true} is VALID [2022-02-20 18:39:09,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {37849#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {37849#true} is VALID [2022-02-20 18:39:09,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {37849#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {37849#true} is VALID [2022-02-20 18:39:09,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {37849#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {37849#true} is VALID [2022-02-20 18:39:09,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {37849#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {37849#true} is VALID [2022-02-20 18:39:09,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {37849#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {37849#true} is VALID [2022-02-20 18:39:09,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {37849#true} assume ~id1~0 != ~id2~0; {37849#true} is VALID [2022-02-20 18:39:09,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {37849#true} assume ~id1~0 != ~id3~0; {37849#true} is VALID [2022-02-20 18:39:09,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {37849#true} assume ~id2~0 != ~id3~0; {37849#true} is VALID [2022-02-20 18:39:09,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {37849#true} assume ~id1~0 >= 0; {37849#true} is VALID [2022-02-20 18:39:09,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {37849#true} assume ~id2~0 >= 0; {37849#true} is VALID [2022-02-20 18:39:09,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {37849#true} assume ~id3~0 >= 0; {37849#true} is VALID [2022-02-20 18:39:09,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {37849#true} assume 0 == ~r1~0; {37849#true} is VALID [2022-02-20 18:39:09,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {37849#true} assume 0 == ~r2~0; {37849#true} is VALID [2022-02-20 18:39:09,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {37849#true} assume 0 == ~r3~0; {37849#true} is VALID [2022-02-20 18:39:09,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {37849#true} assume !(0 == main_~init__r122~0#1 % 256); {37849#true} is VALID [2022-02-20 18:39:09,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {37849#true} assume !(0 == main_~init__r132~0#1 % 256); {37849#true} is VALID [2022-02-20 18:39:09,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {37849#true} assume !(0 == main_~init__r212~0#1 % 256); {37849#true} is VALID [2022-02-20 18:39:09,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {37849#true} assume !(0 == main_~init__r232~0#1 % 256); {37849#true} is VALID [2022-02-20 18:39:09,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {37849#true} assume !(0 == main_~init__r312~0#1 % 256); {37849#true} is VALID [2022-02-20 18:39:09,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {37849#true} assume !(0 == main_~init__r322~0#1 % 256); {37849#true} is VALID [2022-02-20 18:39:09,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {37849#true} assume ~max1~0 == ~id1~0; {37849#true} is VALID [2022-02-20 18:39:09,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {37849#true} assume ~max2~0 == ~id2~0; {37849#true} is VALID [2022-02-20 18:39:09,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {37849#true} assume ~max3~0 == ~id3~0; {37849#true} is VALID [2022-02-20 18:39:09,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {37849#true} assume 0 == ~st1~0; {37849#true} is VALID [2022-02-20 18:39:09,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {37849#true} assume 0 == ~st2~0; {37849#true} is VALID [2022-02-20 18:39:09,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {37849#true} assume 0 == ~st3~0; {37849#true} is VALID [2022-02-20 18:39:09,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {37849#true} assume 0 == ~nl1~0; {37849#true} is VALID [2022-02-20 18:39:09,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {37849#true} assume 0 == ~nl2~0; {37849#true} is VALID [2022-02-20 18:39:09,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {37849#true} assume 0 == ~nl3~0; {37849#true} is VALID [2022-02-20 18:39:09,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {37849#true} assume 0 == ~mode1~0 % 256; {37849#true} is VALID [2022-02-20 18:39:09,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {37849#true} assume 0 == ~mode2~0 % 256; {37849#true} is VALID [2022-02-20 18:39:09,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {37849#true} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1780~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1780~0; {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:09,158 INFO L290 TraceCheckUtils]: 41: Hoare triple {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:09,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 6; {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:09,159 INFO L290 TraceCheckUtils]: 43: Hoare triple {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:09,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 < 2; {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:09,160 INFO L290 TraceCheckUtils]: 45: Hoare triple {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep12~0 % 256); {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:09,160 INFO L290 TraceCheckUtils]: 46: Hoare triple {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep13~0 % 256); {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:09,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:09,161 INFO L290 TraceCheckUtils]: 48: Hoare triple {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:09,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 < 2; {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:09,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep21~0 % 256); {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:09,162 INFO L290 TraceCheckUtils]: 51: Hoare triple {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep23~0 % 256); {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:09,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:09,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {37851#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {37850#false} is VALID [2022-02-20 18:39:09,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {37850#false} assume !!(0 == ~ep13~0 % 256); {37850#false} is VALID [2022-02-20 18:39:09,164 INFO L290 TraceCheckUtils]: 55: Hoare triple {37850#false} assume !!(0 == ~ep23~0 % 256); {37850#false} is VALID [2022-02-20 18:39:09,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {37850#false} assume 2 == ~r3~0; {37850#false} is VALID [2022-02-20 18:39:09,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {37850#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {37850#false} is VALID [2022-02-20 18:39:09,164 INFO L290 TraceCheckUtils]: 58: Hoare triple {37850#false} ~mode3~0 := 0; {37850#false} is VALID [2022-02-20 18:39:09,165 INFO L290 TraceCheckUtils]: 59: Hoare triple {37850#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {37850#false} is VALID [2022-02-20 18:39:09,165 INFO L290 TraceCheckUtils]: 60: Hoare triple {37850#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {37850#false} is VALID [2022-02-20 18:39:09,165 INFO L290 TraceCheckUtils]: 61: Hoare triple {37850#false} ~__return_1911~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1911~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {37850#false} is VALID [2022-02-20 18:39:09,165 INFO L290 TraceCheckUtils]: 62: Hoare triple {37850#false} assume 0 == main_~assert__arg~0#1 % 256; {37850#false} is VALID [2022-02-20 18:39:09,165 INFO L290 TraceCheckUtils]: 63: Hoare triple {37850#false} assume !false; {37850#false} is VALID [2022-02-20 18:39:09,166 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 18:39:09,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:09,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585453730] [2022-02-20 18:39:09,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585453730] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:09,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:09,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:09,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363429297] [2022-02-20 18:39:09,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:09,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:39:09,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:09,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:09,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:09,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:09,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:09,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:09,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:09,219 INFO L87 Difference]: Start difference. First operand 2127 states and 3466 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:12,440 INFO L93 Difference]: Finished difference Result 4121 states and 6752 transitions. [2022-02-20 18:39:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:39:12,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:39:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-02-20 18:39:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-02-20 18:39:12,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 436 transitions. [2022-02-20 18:39:12,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:13,066 INFO L225 Difference]: With dead ends: 4121 [2022-02-20 18:39:13,066 INFO L226 Difference]: Without dead ends: 2979 [2022-02-20 18:39:13,068 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 18:39:13,068 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 106 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:13,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 426 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2022-02-20 18:39:15,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2977. [2022-02-20 18:39:15,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:15,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2979 states. Second operand has 2977 states, 2976 states have (on average 1.6256720430107527) internal successors, (4838), 2976 states have internal predecessors, (4838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:15,465 INFO L74 IsIncluded]: Start isIncluded. First operand 2979 states. Second operand has 2977 states, 2976 states have (on average 1.6256720430107527) internal successors, (4838), 2976 states have internal predecessors, (4838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:15,468 INFO L87 Difference]: Start difference. First operand 2979 states. Second operand has 2977 states, 2976 states have (on average 1.6256720430107527) internal successors, (4838), 2976 states have internal predecessors, (4838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:15,769 INFO L93 Difference]: Finished difference Result 2979 states and 4839 transitions. [2022-02-20 18:39:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 4839 transitions. [2022-02-20 18:39:15,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:15,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:15,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 2977 states, 2976 states have (on average 1.6256720430107527) internal successors, (4838), 2976 states have internal predecessors, (4838), 0 states have call successors, (0), 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 2979 states. [2022-02-20 18:39:15,782 INFO L87 Difference]: Start difference. First operand has 2977 states, 2976 states have (on average 1.6256720430107527) internal successors, (4838), 2976 states have internal predecessors, (4838), 0 states have call successors, (0), 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 2979 states. [2022-02-20 18:39:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:16,176 INFO L93 Difference]: Finished difference Result 2979 states and 4839 transitions. [2022-02-20 18:39:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 4839 transitions. [2022-02-20 18:39:16,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:16,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:16,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:16,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2977 states, 2976 states have (on average 1.6256720430107527) internal successors, (4838), 2976 states have internal predecessors, (4838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 4838 transitions. [2022-02-20 18:39:16,608 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 4838 transitions. Word has length 64 [2022-02-20 18:39:16,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:16,608 INFO L470 AbstractCegarLoop]: Abstraction has 2977 states and 4838 transitions. [2022-02-20 18:39:16,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 4838 transitions. [2022-02-20 18:39:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:39:16,609 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:16,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:16,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:39:16,609 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:16,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:16,610 INFO L85 PathProgramCache]: Analyzing trace with hash -358605347, now seen corresponding path program 1 times [2022-02-20 18:39:16,610 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:16,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426998382] [2022-02-20 18:39:16,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:16,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:16,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {54191#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1780~0 := 0;~__return_1911~0 := 0;~__return_2009~0 := 0; {54191#true} is VALID [2022-02-20 18:39:16,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {54191#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {54191#true} is VALID [2022-02-20 18:39:16,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {54191#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {54191#true} is VALID [2022-02-20 18:39:16,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {54191#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {54191#true} is VALID [2022-02-20 18:39:16,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {54191#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {54191#true} is VALID [2022-02-20 18:39:16,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {54191#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {54191#true} is VALID [2022-02-20 18:39:16,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {54191#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {54191#true} is VALID [2022-02-20 18:39:16,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {54191#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {54191#true} is VALID [2022-02-20 18:39:16,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {54191#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {54191#true} is VALID [2022-02-20 18:39:16,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {54191#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {54191#true} is VALID [2022-02-20 18:39:16,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {54191#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {54191#true} is VALID [2022-02-20 18:39:16,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {54191#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {54191#true} is VALID [2022-02-20 18:39:16,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {54191#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {54191#true} is VALID [2022-02-20 18:39:16,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {54191#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {54191#true} is VALID [2022-02-20 18:39:16,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {54191#true} assume ~id1~0 != ~id2~0; {54191#true} is VALID [2022-02-20 18:39:16,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {54191#true} assume ~id1~0 != ~id3~0; {54191#true} is VALID [2022-02-20 18:39:16,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {54191#true} assume ~id2~0 != ~id3~0; {54191#true} is VALID [2022-02-20 18:39:16,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {54191#true} assume ~id1~0 >= 0; {54191#true} is VALID [2022-02-20 18:39:16,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {54191#true} assume ~id2~0 >= 0; {54191#true} is VALID [2022-02-20 18:39:16,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {54191#true} assume ~id3~0 >= 0; {54191#true} is VALID [2022-02-20 18:39:16,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {54191#true} assume 0 == ~r1~0; {54191#true} is VALID [2022-02-20 18:39:16,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {54191#true} assume 0 == ~r2~0; {54191#true} is VALID [2022-02-20 18:39:16,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {54191#true} assume 0 == ~r3~0; {54191#true} is VALID [2022-02-20 18:39:16,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {54191#true} assume !(0 == main_~init__r122~0#1 % 256); {54191#true} is VALID [2022-02-20 18:39:16,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {54191#true} assume !(0 == main_~init__r132~0#1 % 256); {54191#true} is VALID [2022-02-20 18:39:16,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {54191#true} assume !(0 == main_~init__r212~0#1 % 256); {54191#true} is VALID [2022-02-20 18:39:16,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {54191#true} assume !(0 == main_~init__r232~0#1 % 256); {54191#true} is VALID [2022-02-20 18:39:16,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {54191#true} assume !(0 == main_~init__r312~0#1 % 256); {54191#true} is VALID [2022-02-20 18:39:16,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {54191#true} assume !(0 == main_~init__r322~0#1 % 256); {54191#true} is VALID [2022-02-20 18:39:16,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {54191#true} assume ~max1~0 == ~id1~0; {54191#true} is VALID [2022-02-20 18:39:16,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {54191#true} assume ~max2~0 == ~id2~0; {54191#true} is VALID [2022-02-20 18:39:16,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {54191#true} assume ~max3~0 == ~id3~0; {54191#true} is VALID [2022-02-20 18:39:16,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {54191#true} assume 0 == ~st1~0; {54191#true} is VALID [2022-02-20 18:39:16,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {54191#true} assume 0 == ~st2~0; {54191#true} is VALID [2022-02-20 18:39:16,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {54191#true} assume 0 == ~st3~0; {54191#true} is VALID [2022-02-20 18:39:16,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {54191#true} assume 0 == ~nl1~0; {54191#true} is VALID [2022-02-20 18:39:16,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {54191#true} assume 0 == ~nl2~0; {54191#true} is VALID [2022-02-20 18:39:16,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {54191#true} assume 0 == ~nl3~0; {54191#true} is VALID [2022-02-20 18:39:16,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {54191#true} assume 0 == ~mode1~0 % 256; {54193#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:39:16,664 INFO L290 TraceCheckUtils]: 39: Hoare triple {54193#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {54193#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:39:16,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {54193#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1780~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1780~0; {54193#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:39:16,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {54193#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {54193#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:39:16,665 INFO L290 TraceCheckUtils]: 42: Hoare triple {54193#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 6; {54193#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:39:16,666 INFO L290 TraceCheckUtils]: 43: Hoare triple {54193#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {54192#false} is VALID [2022-02-20 18:39:16,666 INFO L290 TraceCheckUtils]: 44: Hoare triple {54192#false} assume !!(0 == ~ep21~0 % 256); {54192#false} is VALID [2022-02-20 18:39:16,666 INFO L290 TraceCheckUtils]: 45: Hoare triple {54192#false} assume !!(0 == ~ep31~0 % 256); {54192#false} is VALID [2022-02-20 18:39:16,666 INFO L290 TraceCheckUtils]: 46: Hoare triple {54192#false} assume 2 == ~r1~0; {54192#false} is VALID [2022-02-20 18:39:16,666 INFO L290 TraceCheckUtils]: 47: Hoare triple {54192#false} assume !(~max1~0 == ~id1~0);~st1~0 := 1; {54192#false} is VALID [2022-02-20 18:39:16,667 INFO L290 TraceCheckUtils]: 48: Hoare triple {54192#false} ~mode1~0 := 0; {54192#false} is VALID [2022-02-20 18:39:16,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {54192#false} assume !!(0 == ~mode2~0 % 256); {54192#false} is VALID [2022-02-20 18:39:16,667 INFO L290 TraceCheckUtils]: 50: Hoare triple {54192#false} assume ~r2~0 < 2; {54192#false} is VALID [2022-02-20 18:39:16,667 INFO L290 TraceCheckUtils]: 51: Hoare triple {54192#false} assume !!(0 == ~ep21~0 % 256); {54192#false} is VALID [2022-02-20 18:39:16,667 INFO L290 TraceCheckUtils]: 52: Hoare triple {54192#false} assume !!(0 == ~ep23~0 % 256); {54192#false} is VALID [2022-02-20 18:39:16,667 INFO L290 TraceCheckUtils]: 53: Hoare triple {54192#false} ~mode2~0 := 1; {54192#false} is VALID [2022-02-20 18:39:16,667 INFO L290 TraceCheckUtils]: 54: Hoare triple {54192#false} assume !!(0 == ~mode3~0 % 256); {54192#false} is VALID [2022-02-20 18:39:16,668 INFO L290 TraceCheckUtils]: 55: Hoare triple {54192#false} assume ~r3~0 < 2; {54192#false} is VALID [2022-02-20 18:39:16,668 INFO L290 TraceCheckUtils]: 56: Hoare triple {54192#false} assume !!(0 == ~ep31~0 % 256); {54192#false} is VALID [2022-02-20 18:39:16,668 INFO L290 TraceCheckUtils]: 57: Hoare triple {54192#false} assume !!(0 == ~ep32~0 % 256); {54192#false} is VALID [2022-02-20 18:39:16,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {54192#false} ~mode3~0 := 1; {54192#false} is VALID [2022-02-20 18:39:16,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {54192#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {54192#false} is VALID [2022-02-20 18:39:16,668 INFO L290 TraceCheckUtils]: 60: Hoare triple {54192#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {54192#false} is VALID [2022-02-20 18:39:16,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {54192#false} ~__return_1911~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1911~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {54192#false} is VALID [2022-02-20 18:39:16,669 INFO L290 TraceCheckUtils]: 62: Hoare triple {54192#false} assume 0 == main_~assert__arg~0#1 % 256; {54192#false} is VALID [2022-02-20 18:39:16,669 INFO L290 TraceCheckUtils]: 63: Hoare triple {54192#false} assume !false; {54192#false} is VALID [2022-02-20 18:39:16,669 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 18:39:16,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:16,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426998382] [2022-02-20 18:39:16,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426998382] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:16,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:16,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:16,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295136608] [2022-02-20 18:39:16,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:16,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:39:16,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:16,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:16,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:16,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:16,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:16,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:16,717 INFO L87 Difference]: Start difference. First operand 2977 states and 4838 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:21,982 INFO L93 Difference]: Finished difference Result 6399 states and 10550 transitions. [2022-02-20 18:39:21,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:39:21,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:39:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-02-20 18:39:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-02-20 18:39:21,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 436 transitions. [2022-02-20 18:39:22,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:22,984 INFO L225 Difference]: With dead ends: 6399 [2022-02-20 18:39:22,984 INFO L226 Difference]: Without dead ends: 4313 [2022-02-20 18:39:22,987 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 18:39:22,988 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 116 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:22,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 467 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2022-02-20 18:39:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4311. [2022-02-20 18:39:26,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:26,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4313 states. Second operand has 4311 states, 4310 states have (on average 1.6331786542923434) internal successors, (7039), 4310 states have internal predecessors, (7039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:26,246 INFO L74 IsIncluded]: Start isIncluded. First operand 4313 states. Second operand has 4311 states, 4310 states have (on average 1.6331786542923434) internal successors, (7039), 4310 states have internal predecessors, (7039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:26,253 INFO L87 Difference]: Start difference. First operand 4313 states. Second operand has 4311 states, 4310 states have (on average 1.6331786542923434) internal successors, (7039), 4310 states have internal predecessors, (7039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:26,796 INFO L93 Difference]: Finished difference Result 4313 states and 7040 transitions. [2022-02-20 18:39:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 7040 transitions. [2022-02-20 18:39:26,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:26,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:26,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 4311 states, 4310 states have (on average 1.6331786542923434) internal successors, (7039), 4310 states have internal predecessors, (7039), 0 states have call successors, (0), 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 4313 states. [2022-02-20 18:39:26,811 INFO L87 Difference]: Start difference. First operand has 4311 states, 4310 states have (on average 1.6331786542923434) internal successors, (7039), 4310 states have internal predecessors, (7039), 0 states have call successors, (0), 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 4313 states. [2022-02-20 18:39:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:27,356 INFO L93 Difference]: Finished difference Result 4313 states and 7040 transitions. [2022-02-20 18:39:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 7040 transitions. [2022-02-20 18:39:27,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:27,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:27,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:27,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4311 states, 4310 states have (on average 1.6331786542923434) internal successors, (7039), 4310 states have internal predecessors, (7039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 7039 transitions. [2022-02-20 18:39:28,220 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 7039 transitions. Word has length 64 [2022-02-20 18:39:28,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:28,220 INFO L470 AbstractCegarLoop]: Abstraction has 4311 states and 7039 transitions. [2022-02-20 18:39:28,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 7039 transitions. [2022-02-20 18:39:28,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:39:28,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:28,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:28,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:39:28,221 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:28,222 INFO L85 PathProgramCache]: Analyzing trace with hash -214961207, now seen corresponding path program 1 times [2022-02-20 18:39:28,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:28,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910494618] [2022-02-20 18:39:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:28,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:28,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {78452#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(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1780~0 := 0;~__return_1911~0 := 0;~__return_2009~0 := 0; {78452#true} is VALID [2022-02-20 18:39:28,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {78452#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {78452#true} is VALID [2022-02-20 18:39:28,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {78452#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {78452#true} is VALID [2022-02-20 18:39:28,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {78452#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {78452#true} is VALID [2022-02-20 18:39:28,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {78452#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {78452#true} is VALID [2022-02-20 18:39:28,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {78452#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {78452#true} is VALID [2022-02-20 18:39:28,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {78452#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {78452#true} is VALID [2022-02-20 18:39:28,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {78452#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {78452#true} is VALID [2022-02-20 18:39:28,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {78452#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {78452#true} is VALID [2022-02-20 18:39:28,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {78452#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {78452#true} is VALID [2022-02-20 18:39:28,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {78452#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {78452#true} is VALID [2022-02-20 18:39:28,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {78452#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {78452#true} is VALID [2022-02-20 18:39:28,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {78452#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {78452#true} is VALID [2022-02-20 18:39:28,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {78452#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {78452#true} is VALID [2022-02-20 18:39:28,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {78452#true} assume ~id1~0 != ~id2~0; {78452#true} is VALID [2022-02-20 18:39:28,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {78452#true} assume ~id1~0 != ~id3~0; {78452#true} is VALID [2022-02-20 18:39:28,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {78452#true} assume ~id2~0 != ~id3~0; {78452#true} is VALID [2022-02-20 18:39:28,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {78452#true} assume ~id1~0 >= 0; {78452#true} is VALID [2022-02-20 18:39:28,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {78452#true} assume ~id2~0 >= 0; {78452#true} is VALID [2022-02-20 18:39:28,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {78452#true} assume ~id3~0 >= 0; {78452#true} is VALID [2022-02-20 18:39:28,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {78452#true} assume 0 == ~r1~0; {78452#true} is VALID [2022-02-20 18:39:28,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {78452#true} assume 0 == ~r2~0; {78452#true} is VALID [2022-02-20 18:39:28,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {78452#true} assume 0 == ~r3~0; {78452#true} is VALID [2022-02-20 18:39:28,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {78452#true} assume !(0 == main_~init__r122~0#1 % 256); {78452#true} is VALID [2022-02-20 18:39:28,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {78452#true} assume !(0 == main_~init__r132~0#1 % 256); {78452#true} is VALID [2022-02-20 18:39:28,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {78452#true} assume !(0 == main_~init__r212~0#1 % 256); {78452#true} is VALID [2022-02-20 18:39:28,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {78452#true} assume !(0 == main_~init__r232~0#1 % 256); {78452#true} is VALID [2022-02-20 18:39:28,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {78452#true} assume !(0 == main_~init__r312~0#1 % 256); {78452#true} is VALID [2022-02-20 18:39:28,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {78452#true} assume !(0 == main_~init__r322~0#1 % 256); {78452#true} is VALID [2022-02-20 18:39:28,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {78452#true} assume ~max1~0 == ~id1~0; {78452#true} is VALID [2022-02-20 18:39:28,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {78452#true} assume ~max2~0 == ~id2~0; {78452#true} is VALID [2022-02-20 18:39:28,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {78452#true} assume ~max3~0 == ~id3~0; {78452#true} is VALID [2022-02-20 18:39:28,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {78452#true} assume 0 == ~st1~0; {78452#true} is VALID [2022-02-20 18:39:28,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {78452#true} assume 0 == ~st2~0; {78454#(<= ~st2~0 0)} is VALID [2022-02-20 18:39:28,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {78454#(<= ~st2~0 0)} assume 0 == ~st3~0; {78454#(<= ~st2~0 0)} is VALID [2022-02-20 18:39:28,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {78454#(<= ~st2~0 0)} assume 0 == ~nl1~0; {78454#(<= ~st2~0 0)} is VALID [2022-02-20 18:39:28,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {78454#(<= ~st2~0 0)} assume 0 == ~nl2~0; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,297 INFO L290 TraceCheckUtils]: 37: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1780~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1780~0; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 < 2; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep12~0 % 256); {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep13~0 % 256); {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 < 2; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,302 INFO L290 TraceCheckUtils]: 50: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep21~0 % 256); {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,302 INFO L290 TraceCheckUtils]: 51: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep23~0 % 256); {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,302 INFO L290 TraceCheckUtils]: 52: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,303 INFO L290 TraceCheckUtils]: 54: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 < 2; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep31~0 % 256); {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,304 INFO L290 TraceCheckUtils]: 56: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep32~0 % 256); {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {78455#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:28,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {78455#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);main_~check__tmp~0#1 := 0; {78453#false} is VALID [2022-02-20 18:39:28,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {78453#false} ~__return_1911~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1911~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {78453#false} is VALID [2022-02-20 18:39:28,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {78453#false} assume 0 == main_~assert__arg~0#1 % 256; {78453#false} is VALID [2022-02-20 18:39:28,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {78453#false} assume !false; {78453#false} is VALID [2022-02-20 18:39:28,307 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 18:39:28,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:28,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910494618] [2022-02-20 18:39:28,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910494618] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:28,307 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:28,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:39:28,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177281580] [2022-02-20 18:39:28,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:28,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:39:28,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:28,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:28,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:28,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:39:28,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:28,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:39:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:39:28,352 INFO L87 Difference]: Start difference. First operand 4311 states and 7039 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:45,841 INFO L93 Difference]: Finished difference Result 13702 states and 22482 transitions. [2022-02-20 18:39:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:45,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:39:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 600 transitions. [2022-02-20 18:39:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 600 transitions. [2022-02-20 18:39:45,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 600 transitions. [2022-02-20 18:39:46,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 600 edges. 600 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:49,560 INFO L225 Difference]: With dead ends: 13702 [2022-02-20 18:39:49,561 INFO L226 Difference]: Without dead ends: 9473 [2022-02-20 18:39:49,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:49,567 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 377 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:49,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 681 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9473 states.