./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.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/pals_floodmax.3.4.ufo.UNBOUNDED.pals.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 f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:24:28,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:24:28,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:24:28,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:24:28,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:24:28,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:24:28,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:24:28,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:24:28,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:24:28,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:24:28,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:24:28,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:24:28,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:24:28,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:24:28,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:24:28,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:24:28,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:24:28,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:24:28,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:24:28,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:24:28,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:24:28,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:24:28,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:24:28,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:24:28,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:24:28,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:24:28,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:24:28,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:24:28,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:24:28,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:24:28,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:24:28,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:24:28,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:24:28,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:24:28,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:24:28,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:24:28,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:24:28,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:24:28,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:24:28,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:24:28,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:24:28,341 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:24:28,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:24:28,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:24:28,369 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:24:28,370 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:24:28,370 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:24:28,370 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:24:28,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:24:28,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:24:28,371 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:24:28,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:24:28,372 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:24:28,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:24:28,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:24:28,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:24:28,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:24:28,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:24:28,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:24:28,373 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:24:28,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:24:28,373 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:24:28,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:24:28,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:24:28,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:24:28,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:24:28,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:24:28,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:24:28,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:24:28,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:24:28,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:24:28,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:24:28,376 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:24:28,376 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:24:28,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:24:28,377 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 -> f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 [2022-02-20 18:24:28,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:24:28,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:24:28,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:24:28,616 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:24:28,618 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:24:28,619 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2022-02-20 18:24:28,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6342a2a17/565c8e6c1d9a46b899823519f8b0c8a0/FLAGa79933af4 [2022-02-20 18:24:29,073 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:24:29,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2022-02-20 18:24:29,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6342a2a17/565c8e6c1d9a46b899823519f8b0c8a0/FLAGa79933af4 [2022-02-20 18:24:29,462 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6342a2a17/565c8e6c1d9a46b899823519f8b0c8a0 [2022-02-20 18:24:29,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:24:29,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:24:29,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:24:29,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:24:29,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:24:29,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:24:29" (1/1) ... [2022-02-20 18:24:29,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b9364c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:29, skipping insertion in model container [2022-02-20 18:24:29,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:24:29" (1/1) ... [2022-02-20 18:24:29,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:24:29,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:24:29,699 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/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2022-02-20 18:24:29,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:24:29,714 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:24:29,767 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/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2022-02-20 18:24:29,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:24:29,780 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:24:29,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:29 WrapperNode [2022-02-20 18:24:29,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:24:29,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:24:29,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:24:29,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:24:29,787 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:24:29" (1/1) ... [2022-02-20 18:24:29,805 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:24:29" (1/1) ... [2022-02-20 18:24:29,844 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 443 [2022-02-20 18:24:29,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:24:29,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:24:29,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:24:29,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:24:29,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:29" (1/1) ... [2022-02-20 18:24:29,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:29" (1/1) ... [2022-02-20 18:24:29,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:29" (1/1) ... [2022-02-20 18:24:29,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:29" (1/1) ... [2022-02-20 18:24:29,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:29" (1/1) ... [2022-02-20 18:24:29,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:29" (1/1) ... [2022-02-20 18:24:29,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:29" (1/1) ... [2022-02-20 18:24:29,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:24:29,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:24:29,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:24:29,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:24:29,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:29" (1/1) ... [2022-02-20 18:24:29,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:24:29,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:24:29,944 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:24:29,946 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:24:29,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:24:29,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:24:29,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:24:29,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:24:30,056 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:24:30,057 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:24:30,577 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:24:30,583 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:24:30,587 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:24:30,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:24:30 BoogieIcfgContainer [2022-02-20 18:24:30,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:24:30,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:24:30,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:24:30,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:24:30,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:24:29" (1/3) ... [2022-02-20 18:24:30,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274df1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:24:30, skipping insertion in model container [2022-02-20 18:24:30,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:24:29" (2/3) ... [2022-02-20 18:24:30,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274df1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:24:30, skipping insertion in model container [2022-02-20 18:24:30,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:24:30" (3/3) ... [2022-02-20 18:24:30,596 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2022-02-20 18:24:30,599 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:24:30,599 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:24:30,628 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:24:30,632 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:24:30,633 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:24:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 135 states have (on average 1.7481481481481482) internal successors, (236), 136 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:24:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:30,652 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:30,652 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] [2022-02-20 18:24:30,653 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash 298975739, now seen corresponding path program 1 times [2022-02-20 18:24:30,662 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:30,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484642654] [2022-02-20 18:24:30,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:30,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:30,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#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(39, 2);call #Ultimate.allocInit(12, 3);~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; {140#true} is VALID [2022-02-20 18:24:30,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {140#true} is VALID [2022-02-20 18:24:30,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:30,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {140#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:30,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {140#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:30,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {140#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:30,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:30,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {140#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:30,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:30,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:30,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {140#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:30,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:30,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {140#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {140#true} is VALID [2022-02-20 18:24:30,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {140#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {140#true} is VALID [2022-02-20 18:24:30,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {140#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {140#true} is VALID [2022-02-20 18:24:30,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {140#true} init_#res#1 := init_~tmp___5~0#1; {140#true} is VALID [2022-02-20 18:24:30,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {140#true} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {140#true} is VALID [2022-02-20 18:24:30,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {140#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {141#false} is VALID [2022-02-20 18:24:30,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {141#false} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {141#false} is VALID [2022-02-20 18:24:30,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {141#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {141#false} is VALID [2022-02-20 18:24:30,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {141#false} assume !(0 != ~mode1~0 % 256); {141#false} is VALID [2022-02-20 18:24:30,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {141#false} assume !(~r1~0 % 256 < 1); {141#false} is VALID [2022-02-20 18:24:30,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {141#false} ~mode1~0 := 1; {141#false} is VALID [2022-02-20 18:24:30,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {141#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {141#false} is VALID [2022-02-20 18:24:30,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {141#false} assume !(0 != ~mode2~0 % 256); {141#false} is VALID [2022-02-20 18:24:30,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {141#false} assume !(~r2~0 % 256 < 2); {141#false} is VALID [2022-02-20 18:24:30,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {141#false} ~mode2~0 := 1; {141#false} is VALID [2022-02-20 18:24:30,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {141#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {141#false} is VALID [2022-02-20 18:24:30,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {141#false} assume !(0 != ~mode3~0 % 256); {141#false} is VALID [2022-02-20 18:24:30,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {141#false} assume !(~r3~0 % 256 < 2); {141#false} is VALID [2022-02-20 18:24:30,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {141#false} ~mode3~0 := 1; {141#false} is VALID [2022-02-20 18:24:30,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {141#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {141#false} is VALID [2022-02-20 18:24:30,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {141#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {141#false} is VALID [2022-02-20 18:24:30,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {141#false} check_#res#1 := check_~tmp~1#1; {141#false} is VALID [2022-02-20 18:24:30,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {141#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {141#false} is VALID [2022-02-20 18:24:30,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {141#false} assume 0 == assert_~arg#1 % 256; {141#false} is VALID [2022-02-20 18:24:30,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {141#false} assume !false; {141#false} is VALID [2022-02-20 18:24:30,928 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:24:30,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:30,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484642654] [2022-02-20 18:24:30,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484642654] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:30,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:30,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:24:30,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447662936] [2022-02-20 18:24:30,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:24:30,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:30,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:24:30,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:30,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:24:30,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:30,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:24:30,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:24:31,003 INFO L87 Difference]: Start difference. First operand has 137 states, 135 states have (on average 1.7481481481481482) internal successors, (236), 136 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 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:24:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:31,161 INFO L93 Difference]: Finished difference Result 214 states and 367 transitions. [2022-02-20 18:24:31,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:24:31,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:24:31,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:24:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 367 transitions. [2022-02-20 18:24:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:24:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 367 transitions. [2022-02-20 18:24:31,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 367 transitions. [2022-02-20 18:24:31,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:31,488 INFO L225 Difference]: With dead ends: 214 [2022-02-20 18:24:31,488 INFO L226 Difference]: Without dead ends: 133 [2022-02-20 18:24:31,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:24:31,492 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:31,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-20 18:24:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-02-20 18:24:31,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:31,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:24:31,519 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:24:31,520 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:24:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:31,524 INFO L93 Difference]: Finished difference Result 133 states and 229 transitions. [2022-02-20 18:24:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 229 transitions. [2022-02-20 18:24:31,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:31,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:31,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 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 133 states. [2022-02-20 18:24:31,527 INFO L87 Difference]: Start difference. First operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 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 133 states. [2022-02-20 18:24:31,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:31,531 INFO L93 Difference]: Finished difference Result 133 states and 229 transitions. [2022-02-20 18:24:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 229 transitions. [2022-02-20 18:24:31,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:31,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:31,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:31,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 132 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:24:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 229 transitions. [2022-02-20 18:24:31,538 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 229 transitions. Word has length 37 [2022-02-20 18:24:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:31,538 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 229 transitions. [2022-02-20 18:24:31,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:24:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 229 transitions. [2022-02-20 18:24:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:24:31,540 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:31,540 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] [2022-02-20 18:24:31,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:24:31,540 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:31,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash -518672711, now seen corresponding path program 1 times [2022-02-20 18:24:31,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:31,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817542251] [2022-02-20 18:24:31,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:31,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:31,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {784#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(39, 2);call #Ultimate.allocInit(12, 3);~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; {784#true} is VALID [2022-02-20 18:24:31,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {784#true} is VALID [2022-02-20 18:24:31,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:31,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {784#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:31,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {784#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:31,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:31,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {784#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:31,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:31,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:31,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:31,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {784#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:31,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {784#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:31,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {784#true} is VALID [2022-02-20 18:24:31,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {784#true} is VALID [2022-02-20 18:24:31,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {786#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:24:31,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {786#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {787#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:24:31,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {787#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {788#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:24:31,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {788#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {785#false} is VALID [2022-02-20 18:24:31,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {785#false} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {785#false} is VALID [2022-02-20 18:24:31,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {785#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {785#false} is VALID [2022-02-20 18:24:31,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {785#false} assume !(0 != ~mode1~0 % 256); {785#false} is VALID [2022-02-20 18:24:31,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {785#false} assume !(~r1~0 % 256 < 1); {785#false} is VALID [2022-02-20 18:24:31,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {785#false} ~mode1~0 := 1; {785#false} is VALID [2022-02-20 18:24:31,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {785#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {785#false} is VALID [2022-02-20 18:24:31,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {785#false} assume !(0 != ~mode2~0 % 256); {785#false} is VALID [2022-02-20 18:24:31,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {785#false} assume !(~r2~0 % 256 < 2); {785#false} is VALID [2022-02-20 18:24:31,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {785#false} ~mode2~0 := 1; {785#false} is VALID [2022-02-20 18:24:31,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {785#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {785#false} is VALID [2022-02-20 18:24:31,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {785#false} assume !(0 != ~mode3~0 % 256); {785#false} is VALID [2022-02-20 18:24:31,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {785#false} assume !(~r3~0 % 256 < 2); {785#false} is VALID [2022-02-20 18:24:31,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {785#false} ~mode3~0 := 1; {785#false} is VALID [2022-02-20 18:24:31,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {785#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {785#false} is VALID [2022-02-20 18:24:31,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {785#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {785#false} is VALID [2022-02-20 18:24:31,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {785#false} check_#res#1 := check_~tmp~1#1; {785#false} is VALID [2022-02-20 18:24:31,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {785#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {785#false} is VALID [2022-02-20 18:24:31,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {785#false} assume 0 == assert_~arg#1 % 256; {785#false} is VALID [2022-02-20 18:24:31,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-02-20 18:24:31,662 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:24:31,663 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:31,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817542251] [2022-02-20 18:24:31,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817542251] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:31,664 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:31,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:31,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804140650] [2022-02-20 18:24:31,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:31,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:24:31,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:31,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:24:31,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:31,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:31,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:31,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:31,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:31,692 INFO L87 Difference]: Start difference. First operand 133 states and 229 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:24:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:32,105 INFO L93 Difference]: Finished difference Result 213 states and 360 transitions. [2022-02-20 18:24:32,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:24:32,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:24:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:24:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 360 transitions. [2022-02-20 18:24:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:24:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 360 transitions. [2022-02-20 18:24:32,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 360 transitions. [2022-02-20 18:24:32,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:32,325 INFO L225 Difference]: With dead ends: 213 [2022-02-20 18:24:32,325 INFO L226 Difference]: Without dead ends: 133 [2022-02-20 18:24:32,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:24:32,327 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 3 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:32,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 878 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-20 18:24:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-02-20 18:24:32,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:32,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have 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:24:32,333 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have 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:24:32,334 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have 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:24:32,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:32,337 INFO L93 Difference]: Finished difference Result 133 states and 202 transitions. [2022-02-20 18:24:32,337 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2022-02-20 18:24:32,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:32,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:32,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 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 133 states. [2022-02-20 18:24:32,339 INFO L87 Difference]: Start difference. First operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 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 133 states. [2022-02-20 18:24:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:32,342 INFO L93 Difference]: Finished difference Result 133 states and 202 transitions. [2022-02-20 18:24:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2022-02-20 18:24:32,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:32,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:32,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:32,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have 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:24:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions. [2022-02-20 18:24:32,346 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 37 [2022-02-20 18:24:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:32,347 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 202 transitions. [2022-02-20 18:24:32,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have 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:24:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2022-02-20 18:24:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:24:32,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:32,348 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:24:32,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:24:32,349 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:32,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash -707453694, now seen corresponding path program 1 times [2022-02-20 18:24:32,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:32,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364345182] [2022-02-20 18:24:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:32,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:32,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {1434#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(39, 2);call #Ultimate.allocInit(12, 3);~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; {1434#true} is VALID [2022-02-20 18:24:32,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {1434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {1434#true} is VALID [2022-02-20 18:24:32,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {1434#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:32,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {1434#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:32,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {1434#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:32,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {1434#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:32,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {1434#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:32,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:32,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {1434#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:32,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:32,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:32,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:32,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {1434#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1434#true} is VALID [2022-02-20 18:24:32,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {1434#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1434#true} is VALID [2022-02-20 18:24:32,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#true} assume ~id1~0 != ~id2~0; {1434#true} is VALID [2022-02-20 18:24:32,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#true} assume ~id1~0 != ~id3~0; {1434#true} is VALID [2022-02-20 18:24:32,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#true} assume ~id2~0 != ~id3~0; {1434#true} is VALID [2022-02-20 18:24:32,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {1434#true} assume ~id1~0 >= 0; {1434#true} is VALID [2022-02-20 18:24:32,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {1434#true} assume ~id2~0 >= 0; {1434#true} is VALID [2022-02-20 18:24:32,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {1434#true} assume ~id3~0 >= 0; {1434#true} is VALID [2022-02-20 18:24:32,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {1434#true} assume 0 == ~r1~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r122~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r132~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r212~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r232~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r312~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r322~0#1 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp___5~0#1; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,476 INFO L290 TraceCheckUtils]: 42: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,487 INFO L290 TraceCheckUtils]: 45: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,488 INFO L290 TraceCheckUtils]: 46: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:24:32,489 INFO L290 TraceCheckUtils]: 47: Hoare triple {1436#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 1); {1435#false} is VALID [2022-02-20 18:24:32,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {1435#false} ~mode1~0 := 1; {1435#false} is VALID [2022-02-20 18:24:32,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {1435#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {1435#false} is VALID [2022-02-20 18:24:32,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {1435#false} assume !(0 != ~mode2~0 % 256); {1435#false} is VALID [2022-02-20 18:24:32,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {1435#false} assume !(~r2~0 % 256 < 2); {1435#false} is VALID [2022-02-20 18:24:32,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {1435#false} ~mode2~0 := 1; {1435#false} is VALID [2022-02-20 18:24:32,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {1435#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {1435#false} is VALID [2022-02-20 18:24:32,492 INFO L290 TraceCheckUtils]: 54: Hoare triple {1435#false} assume !(0 != ~mode3~0 % 256); {1435#false} is VALID [2022-02-20 18:24:32,495 INFO L290 TraceCheckUtils]: 55: Hoare triple {1435#false} assume !(~r3~0 % 256 < 2); {1435#false} is VALID [2022-02-20 18:24:32,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {1435#false} ~mode3~0 := 1; {1435#false} is VALID [2022-02-20 18:24:32,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {1435#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1435#false} is VALID [2022-02-20 18:24:32,495 INFO L290 TraceCheckUtils]: 58: Hoare triple {1435#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1435#false} is VALID [2022-02-20 18:24:32,495 INFO L290 TraceCheckUtils]: 59: Hoare triple {1435#false} check_#res#1 := check_~tmp~1#1; {1435#false} is VALID [2022-02-20 18:24:32,495 INFO L290 TraceCheckUtils]: 60: Hoare triple {1435#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1435#false} is VALID [2022-02-20 18:24:32,496 INFO L290 TraceCheckUtils]: 61: Hoare triple {1435#false} assume 0 == assert_~arg#1 % 256; {1435#false} is VALID [2022-02-20 18:24:32,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {1435#false} assume !false; {1435#false} is VALID [2022-02-20 18:24:32,496 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:24:32,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:32,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364345182] [2022-02-20 18:24:32,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364345182] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:32,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:32,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:32,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990358712] [2022-02-20 18:24:32,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:32,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:24:32,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:32,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:24:32,532 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:24:32,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:32,533 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:32,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:32,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:32,534 INFO L87 Difference]: Start difference. First operand 133 states and 202 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:24:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:32,747 INFO L93 Difference]: Finished difference Result 270 states and 429 transitions. [2022-02-20 18:24:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:32,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:24:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:24:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-02-20 18:24:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:24:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-02-20 18:24:32,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 429 transitions. [2022-02-20 18:24:33,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:33,019 INFO L225 Difference]: With dead ends: 270 [2022-02-20 18:24:33,019 INFO L226 Difference]: Without dead ends: 194 [2022-02-20 18:24:33,020 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:24:33,020 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 101 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:33,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 345 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-02-20 18:24:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2022-02-20 18:24:33,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:33,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 191 states, 190 states have (on average 1.5473684210526315) internal successors, (294), 190 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have 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:24:33,046 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 191 states, 190 states have (on average 1.5473684210526315) internal successors, (294), 190 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have 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:24:33,046 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 191 states, 190 states have (on average 1.5473684210526315) internal successors, (294), 190 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have 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:24:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:33,050 INFO L93 Difference]: Finished difference Result 194 states and 296 transitions. [2022-02-20 18:24:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 296 transitions. [2022-02-20 18:24:33,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:33,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:33,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 190 states have (on average 1.5473684210526315) internal successors, (294), 190 states have internal predecessors, (294), 0 states have call successors, (0), 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 194 states. [2022-02-20 18:24:33,051 INFO L87 Difference]: Start difference. First operand has 191 states, 190 states have (on average 1.5473684210526315) internal successors, (294), 190 states have internal predecessors, (294), 0 states have call successors, (0), 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 194 states. [2022-02-20 18:24:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:33,056 INFO L93 Difference]: Finished difference Result 194 states and 296 transitions. [2022-02-20 18:24:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 296 transitions. [2022-02-20 18:24:33,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:33,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:33,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:33,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:33,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.5473684210526315) internal successors, (294), 190 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have 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:24:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 294 transitions. [2022-02-20 18:24:33,060 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 294 transitions. Word has length 63 [2022-02-20 18:24:33,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:33,061 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 294 transitions. [2022-02-20 18:24:33,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:24:33,061 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 294 transitions. [2022-02-20 18:24:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:24:33,062 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:33,062 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:24:33,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:24:33,062 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:33,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:33,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1995563601, now seen corresponding path program 1 times [2022-02-20 18:24:33,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:33,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54983948] [2022-02-20 18:24:33,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:33,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:33,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {2330#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(39, 2);call #Ultimate.allocInit(12, 3);~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; {2330#true} is VALID [2022-02-20 18:24:33,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {2330#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2330#true} is VALID [2022-02-20 18:24:33,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {2330#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2330#true} is VALID [2022-02-20 18:24:33,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {2330#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2330#true} is VALID [2022-02-20 18:24:33,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {2330#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2330#true} is VALID [2022-02-20 18:24:33,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {2330#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2330#true} is VALID [2022-02-20 18:24:33,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {2330#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2330#true} is VALID [2022-02-20 18:24:33,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {2330#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2330#true} is VALID [2022-02-20 18:24:33,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {2330#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2330#true} is VALID [2022-02-20 18:24:33,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {2330#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2330#true} is VALID [2022-02-20 18:24:33,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {2330#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2330#true} is VALID [2022-02-20 18:24:33,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {2330#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2330#true} is VALID [2022-02-20 18:24:33,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {2330#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2330#true} is VALID [2022-02-20 18:24:33,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {2330#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2330#true} is VALID [2022-02-20 18:24:33,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {2330#true} assume ~id1~0 != ~id2~0; {2330#true} is VALID [2022-02-20 18:24:33,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {2330#true} assume ~id1~0 != ~id3~0; {2330#true} is VALID [2022-02-20 18:24:33,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {2330#true} assume ~id2~0 != ~id3~0; {2330#true} is VALID [2022-02-20 18:24:33,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {2330#true} assume ~id1~0 >= 0; {2330#true} is VALID [2022-02-20 18:24:33,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {2330#true} assume ~id2~0 >= 0; {2330#true} is VALID [2022-02-20 18:24:33,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {2330#true} assume ~id3~0 >= 0; {2330#true} is VALID [2022-02-20 18:24:33,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {2330#true} assume 0 == ~r1~0 % 256; {2330#true} is VALID [2022-02-20 18:24:33,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {2330#true} assume 0 == ~r2~0 % 256; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r122~0#1 % 256; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r132~0#1 % 256; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r212~0#1 % 256; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r232~0#1 % 256; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r312~0#1 % 256; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r322~0#1 % 256; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,148 INFO L290 TraceCheckUtils]: 32: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} init_#res#1 := init_~tmp___5~0#1; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,152 INFO L290 TraceCheckUtils]: 44: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode1~0 % 256); {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,153 INFO L290 TraceCheckUtils]: 47: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 1; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,153 INFO L290 TraceCheckUtils]: 48: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep12~0 % 256); {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep13~0 % 256); {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode2~0 % 256); {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:24:33,155 INFO L290 TraceCheckUtils]: 53: Hoare triple {2332#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {2331#false} is VALID [2022-02-20 18:24:33,155 INFO L290 TraceCheckUtils]: 54: Hoare triple {2331#false} ~mode2~0 := 1; {2331#false} is VALID [2022-02-20 18:24:33,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {2331#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {2331#false} is VALID [2022-02-20 18:24:33,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {2331#false} assume !(0 != ~mode3~0 % 256); {2331#false} is VALID [2022-02-20 18:24:33,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {2331#false} assume !(~r3~0 % 256 < 2); {2331#false} is VALID [2022-02-20 18:24:33,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {2331#false} ~mode3~0 := 1; {2331#false} is VALID [2022-02-20 18:24:33,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {2331#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2331#false} is VALID [2022-02-20 18:24:33,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {2331#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2331#false} is VALID [2022-02-20 18:24:33,156 INFO L290 TraceCheckUtils]: 61: Hoare triple {2331#false} check_#res#1 := check_~tmp~1#1; {2331#false} is VALID [2022-02-20 18:24:33,157 INFO L290 TraceCheckUtils]: 62: Hoare triple {2331#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2331#false} is VALID [2022-02-20 18:24:33,157 INFO L290 TraceCheckUtils]: 63: Hoare triple {2331#false} assume 0 == assert_~arg#1 % 256; {2331#false} is VALID [2022-02-20 18:24:33,157 INFO L290 TraceCheckUtils]: 64: Hoare triple {2331#false} assume !false; {2331#false} is VALID [2022-02-20 18:24:33,157 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:24:33,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:33,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54983948] [2022-02-20 18:24:33,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54983948] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:33,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:33,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:33,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334432909] [2022-02-20 18:24:33,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:33,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:24:33,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:33,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:24:33,194 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:24:33,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:33,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:33,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:33,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:33,196 INFO L87 Difference]: Start difference. First operand 191 states and 294 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:24:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:33,442 INFO L93 Difference]: Finished difference Result 445 states and 706 transitions. [2022-02-20 18:24:33,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:33,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:24:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:24:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 18:24:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:24:33,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 18:24:33,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 443 transitions. [2022-02-20 18:24:33,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:33,729 INFO L225 Difference]: With dead ends: 445 [2022-02-20 18:24:33,729 INFO L226 Difference]: Without dead ends: 311 [2022-02-20 18:24:33,730 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:24:33,731 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 103 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:33,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 368 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-02-20 18:24:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 307. [2022-02-20 18:24:33,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:33,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 307 states, 306 states have (on average 1.5686274509803921) internal successors, (480), 306 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have 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:24:33,780 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 307 states, 306 states have (on average 1.5686274509803921) internal successors, (480), 306 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have 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:24:33,780 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 307 states, 306 states have (on average 1.5686274509803921) internal successors, (480), 306 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have 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:24:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:33,795 INFO L93 Difference]: Finished difference Result 311 states and 483 transitions. [2022-02-20 18:24:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 483 transitions. [2022-02-20 18:24:33,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:33,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:33,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 307 states, 306 states have (on average 1.5686274509803921) internal successors, (480), 306 states have internal predecessors, (480), 0 states have call successors, (0), 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 311 states. [2022-02-20 18:24:33,797 INFO L87 Difference]: Start difference. First operand has 307 states, 306 states have (on average 1.5686274509803921) internal successors, (480), 306 states have internal predecessors, (480), 0 states have call successors, (0), 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 311 states. [2022-02-20 18:24:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:33,804 INFO L93 Difference]: Finished difference Result 311 states and 483 transitions. [2022-02-20 18:24:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 483 transitions. [2022-02-20 18:24:33,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:33,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:33,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:33,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.5686274509803921) internal successors, (480), 306 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have 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:24:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 480 transitions. [2022-02-20 18:24:33,814 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 480 transitions. Word has length 65 [2022-02-20 18:24:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:33,814 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 480 transitions. [2022-02-20 18:24:33,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:24:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 480 transitions. [2022-02-20 18:24:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:24:33,815 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:33,816 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, 1, 1] [2022-02-20 18:24:33,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:24:33,816 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2137075392, now seen corresponding path program 1 times [2022-02-20 18:24:33,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:33,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729392901] [2022-02-20 18:24:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:33,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:33,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {3791#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(39, 2);call #Ultimate.allocInit(12, 3);~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; {3791#true} is VALID [2022-02-20 18:24:33,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {3791#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {3791#true} is VALID [2022-02-20 18:24:33,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {3791#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3791#true} is VALID [2022-02-20 18:24:33,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {3791#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3791#true} is VALID [2022-02-20 18:24:33,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {3791#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3791#true} is VALID [2022-02-20 18:24:33,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {3791#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3791#true} is VALID [2022-02-20 18:24:33,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {3791#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {3791#true} is VALID [2022-02-20 18:24:33,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {3791#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3791#true} is VALID [2022-02-20 18:24:33,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {3791#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {3791#true} is VALID [2022-02-20 18:24:33,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {3791#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3791#true} is VALID [2022-02-20 18:24:33,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {3791#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {3791#true} is VALID [2022-02-20 18:24:33,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {3791#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3791#true} is VALID [2022-02-20 18:24:33,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {3791#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {3791#true} is VALID [2022-02-20 18:24:33,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {3791#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3791#true} is VALID [2022-02-20 18:24:33,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {3791#true} assume ~id1~0 != ~id2~0; {3791#true} is VALID [2022-02-20 18:24:33,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {3791#true} assume ~id1~0 != ~id3~0; {3791#true} is VALID [2022-02-20 18:24:33,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {3791#true} assume ~id2~0 != ~id3~0; {3791#true} is VALID [2022-02-20 18:24:33,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {3791#true} assume ~id1~0 >= 0; {3791#true} is VALID [2022-02-20 18:24:33,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {3791#true} assume ~id2~0 >= 0; {3791#true} is VALID [2022-02-20 18:24:33,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {3791#true} assume ~id3~0 >= 0; {3791#true} is VALID [2022-02-20 18:24:33,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {3791#true} assume 0 == ~r1~0 % 256; {3791#true} is VALID [2022-02-20 18:24:33,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {3791#true} assume 0 == ~r2~0 % 256; {3791#true} is VALID [2022-02-20 18:24:33,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {3791#true} assume 0 == ~r3~0 % 256; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r122~0#1 % 256; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r132~0#1 % 256; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r212~0#1 % 256; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r232~0#1 % 256; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r312~0#1 % 256; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r322~0#1 % 256; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,882 INFO L290 TraceCheckUtils]: 34: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} init_#res#1 := init_~tmp___5~0#1; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode1~0 % 256); {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,886 INFO L290 TraceCheckUtils]: 47: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 1; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep12~0 % 256); {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep13~0 % 256); {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,887 INFO L290 TraceCheckUtils]: 50: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,887 INFO L290 TraceCheckUtils]: 51: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,887 INFO L290 TraceCheckUtils]: 52: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode2~0 % 256); {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,887 INFO L290 TraceCheckUtils]: 53: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,888 INFO L290 TraceCheckUtils]: 54: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep21~0 % 256); {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,888 INFO L290 TraceCheckUtils]: 55: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep23~0 % 256); {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,888 INFO L290 TraceCheckUtils]: 56: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,889 INFO L290 TraceCheckUtils]: 57: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,889 INFO L290 TraceCheckUtils]: 58: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode3~0 % 256); {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:24:33,889 INFO L290 TraceCheckUtils]: 59: Hoare triple {3793#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {3792#false} is VALID [2022-02-20 18:24:33,890 INFO L290 TraceCheckUtils]: 60: Hoare triple {3792#false} ~mode3~0 := 1; {3792#false} is VALID [2022-02-20 18:24:33,890 INFO L290 TraceCheckUtils]: 61: Hoare triple {3792#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3792#false} is VALID [2022-02-20 18:24:33,890 INFO L290 TraceCheckUtils]: 62: Hoare triple {3792#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {3792#false} is VALID [2022-02-20 18:24:33,890 INFO L290 TraceCheckUtils]: 63: Hoare triple {3792#false} check_#res#1 := check_~tmp~1#1; {3792#false} is VALID [2022-02-20 18:24:33,890 INFO L290 TraceCheckUtils]: 64: Hoare triple {3792#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3792#false} is VALID [2022-02-20 18:24:33,890 INFO L290 TraceCheckUtils]: 65: Hoare triple {3792#false} assume 0 == assert_~arg#1 % 256; {3792#false} is VALID [2022-02-20 18:24:33,890 INFO L290 TraceCheckUtils]: 66: Hoare triple {3792#false} assume !false; {3792#false} is VALID [2022-02-20 18:24:33,891 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:24:33,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:33,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729392901] [2022-02-20 18:24:33,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729392901] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:33,892 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:33,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:33,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509150926] [2022-02-20 18:24:33,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:33,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:24:33,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:33,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:24:33,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:33,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:33,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:33,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:33,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:33,935 INFO L87 Difference]: Start difference. First operand 307 states and 480 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:24:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:34,204 INFO L93 Difference]: Finished difference Result 779 states and 1238 transitions. [2022-02-20 18:24:34,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:34,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:24:34,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:24:34,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 18:24:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:24:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 18:24:34,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 443 transitions. [2022-02-20 18:24:34,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:34,491 INFO L225 Difference]: With dead ends: 779 [2022-02-20 18:24:34,491 INFO L226 Difference]: Without dead ends: 529 [2022-02-20 18:24:34,492 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:24:34,493 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 97 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:34,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 369 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-02-20 18:24:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 523. [2022-02-20 18:24:34,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:34,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 529 states. Second operand has 523 states, 522 states have (on average 1.5708812260536398) internal successors, (820), 522 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have 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:24:34,542 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand has 523 states, 522 states have (on average 1.5708812260536398) internal successors, (820), 522 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have 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:24:34,543 INFO L87 Difference]: Start difference. First operand 529 states. Second operand has 523 states, 522 states have (on average 1.5708812260536398) internal successors, (820), 522 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have 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:24:34,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:34,554 INFO L93 Difference]: Finished difference Result 529 states and 825 transitions. [2022-02-20 18:24:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 825 transitions. [2022-02-20 18:24:34,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:34,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:34,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 523 states, 522 states have (on average 1.5708812260536398) internal successors, (820), 522 states have internal predecessors, (820), 0 states have call successors, (0), 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 529 states. [2022-02-20 18:24:34,557 INFO L87 Difference]: Start difference. First operand has 523 states, 522 states have (on average 1.5708812260536398) internal successors, (820), 522 states have internal predecessors, (820), 0 states have call successors, (0), 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 529 states. [2022-02-20 18:24:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:34,569 INFO L93 Difference]: Finished difference Result 529 states and 825 transitions. [2022-02-20 18:24:34,569 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 825 transitions. [2022-02-20 18:24:34,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:34,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:34,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:34,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.5708812260536398) internal successors, (820), 522 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have 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:24:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 820 transitions. [2022-02-20 18:24:34,586 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 820 transitions. Word has length 67 [2022-02-20 18:24:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:34,586 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 820 transitions. [2022-02-20 18:24:34,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:24:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 820 transitions. [2022-02-20 18:24:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:24:34,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:34,588 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, 1, 1, 1, 1] [2022-02-20 18:24:34,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:24:34,588 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:34,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:34,588 INFO L85 PathProgramCache]: Analyzing trace with hash -544230961, now seen corresponding path program 1 times [2022-02-20 18:24:34,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:34,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136070823] [2022-02-20 18:24:34,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:34,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:34,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {6318#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(39, 2);call #Ultimate.allocInit(12, 3);~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; {6318#true} is VALID [2022-02-20 18:24:34,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {6318#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {6318#true} is VALID [2022-02-20 18:24:34,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {6318#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {6318#true} is VALID [2022-02-20 18:24:34,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {6318#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {6318#true} is VALID [2022-02-20 18:24:34,666 INFO L290 TraceCheckUtils]: 4: Hoare triple {6318#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {6318#true} is VALID [2022-02-20 18:24:34,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {6318#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {6318#true} is VALID [2022-02-20 18:24:34,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {6318#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {6318#true} is VALID [2022-02-20 18:24:34,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {6318#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {6318#true} is VALID [2022-02-20 18:24:34,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {6318#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {6318#true} is VALID [2022-02-20 18:24:34,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {6318#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {6318#true} is VALID [2022-02-20 18:24:34,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {6318#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {6318#true} is VALID [2022-02-20 18:24:34,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {6318#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {6318#true} is VALID [2022-02-20 18:24:34,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {6318#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {6318#true} is VALID [2022-02-20 18:24:34,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {6318#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {6318#true} is VALID [2022-02-20 18:24:34,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {6318#true} assume ~id1~0 != ~id2~0; {6318#true} is VALID [2022-02-20 18:24:34,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {6318#true} assume ~id1~0 != ~id3~0; {6318#true} is VALID [2022-02-20 18:24:34,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {6318#true} assume ~id2~0 != ~id3~0; {6318#true} is VALID [2022-02-20 18:24:34,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {6318#true} assume ~id1~0 >= 0; {6318#true} is VALID [2022-02-20 18:24:34,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {6318#true} assume ~id2~0 >= 0; {6318#true} is VALID [2022-02-20 18:24:34,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {6318#true} assume ~id3~0 >= 0; {6318#true} is VALID [2022-02-20 18:24:34,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {6318#true} assume 0 == ~r1~0 % 256; {6318#true} is VALID [2022-02-20 18:24:34,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {6318#true} assume 0 == ~r2~0 % 256; {6318#true} is VALID [2022-02-20 18:24:34,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {6318#true} assume 0 == ~r3~0 % 256; {6318#true} is VALID [2022-02-20 18:24:34,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {6318#true} assume 0 != init_~r122~0#1 % 256; {6318#true} is VALID [2022-02-20 18:24:34,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {6318#true} assume 0 != init_~r132~0#1 % 256; {6318#true} is VALID [2022-02-20 18:24:34,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {6318#true} assume 0 != init_~r212~0#1 % 256; {6318#true} is VALID [2022-02-20 18:24:34,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {6318#true} assume 0 != init_~r232~0#1 % 256; {6318#true} is VALID [2022-02-20 18:24:34,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {6318#true} assume 0 != init_~r312~0#1 % 256; {6318#true} is VALID [2022-02-20 18:24:34,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {6318#true} assume 0 != init_~r322~0#1 % 256; {6318#true} is VALID [2022-02-20 18:24:34,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {6318#true} assume ~max1~0 == ~id1~0; {6318#true} is VALID [2022-02-20 18:24:34,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {6318#true} assume ~max2~0 == ~id2~0; {6318#true} is VALID [2022-02-20 18:24:34,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {6318#true} assume ~max3~0 == ~id3~0; {6318#true} is VALID [2022-02-20 18:24:34,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {6318#true} assume 0 == ~st1~0; {6320#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:34,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {6320#(<= ~st1~0 0)} assume 0 == ~st2~0; {6321#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {6321#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,674 INFO L290 TraceCheckUtils]: 40: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,675 INFO L290 TraceCheckUtils]: 44: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 1; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,677 INFO L290 TraceCheckUtils]: 50: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,678 INFO L290 TraceCheckUtils]: 55: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,678 INFO L290 TraceCheckUtils]: 56: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,679 INFO L290 TraceCheckUtils]: 57: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,679 INFO L290 TraceCheckUtils]: 58: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,679 INFO L290 TraceCheckUtils]: 59: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,679 INFO L290 TraceCheckUtils]: 60: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,680 INFO L290 TraceCheckUtils]: 63: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:34,681 INFO L290 TraceCheckUtils]: 64: Hoare triple {6322#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {6319#false} is VALID [2022-02-20 18:24:34,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {6319#false} check_#res#1 := check_~tmp~1#1; {6319#false} is VALID [2022-02-20 18:24:34,681 INFO L290 TraceCheckUtils]: 66: Hoare triple {6319#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {6319#false} is VALID [2022-02-20 18:24:34,681 INFO L290 TraceCheckUtils]: 67: Hoare triple {6319#false} assume 0 == assert_~arg#1 % 256; {6319#false} is VALID [2022-02-20 18:24:34,681 INFO L290 TraceCheckUtils]: 68: Hoare triple {6319#false} assume !false; {6319#false} is VALID [2022-02-20 18:24:34,682 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:24:34,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:34,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136070823] [2022-02-20 18:24:34,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136070823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:34,682 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:34,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:24:34,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465136116] [2022-02-20 18:24:34,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:34,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:24:34,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:34,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:24:34,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:34,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:24:34,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:34,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:24:34,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:24:34,720 INFO L87 Difference]: Start difference. First operand 523 states and 820 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:24:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:36,056 INFO L93 Difference]: Finished difference Result 2639 states and 4230 transitions. [2022-02-20 18:24:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:24:36,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:24:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:24:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 964 transitions. [2022-02-20 18:24:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:24:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 964 transitions. [2022-02-20 18:24:36,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 964 transitions. [2022-02-20 18:24:36,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 964 edges. 964 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:36,862 INFO L225 Difference]: With dead ends: 2639 [2022-02-20 18:24:36,862 INFO L226 Difference]: Without dead ends: 2173 [2022-02-20 18:24:36,863 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:24:36,863 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 861 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:24:36,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 1129 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:24:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2022-02-20 18:24:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 971. [2022-02-20 18:24:37,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:37,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2173 states. Second operand has 971 states, 970 states have (on average 1.579381443298969) internal successors, (1532), 970 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have 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:24:37,073 INFO L74 IsIncluded]: Start isIncluded. First operand 2173 states. Second operand has 971 states, 970 states have (on average 1.579381443298969) internal successors, (1532), 970 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have 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:24:37,074 INFO L87 Difference]: Start difference. First operand 2173 states. Second operand has 971 states, 970 states have (on average 1.579381443298969) internal successors, (1532), 970 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have 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:24:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:37,221 INFO L93 Difference]: Finished difference Result 2173 states and 3455 transitions. [2022-02-20 18:24:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 3455 transitions. [2022-02-20 18:24:37,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:37,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:37,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 971 states, 970 states have (on average 1.579381443298969) internal successors, (1532), 970 states have internal predecessors, (1532), 0 states have call successors, (0), 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 2173 states. [2022-02-20 18:24:37,228 INFO L87 Difference]: Start difference. First operand has 971 states, 970 states have (on average 1.579381443298969) internal successors, (1532), 970 states have internal predecessors, (1532), 0 states have call successors, (0), 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 2173 states. [2022-02-20 18:24:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:37,369 INFO L93 Difference]: Finished difference Result 2173 states and 3455 transitions. [2022-02-20 18:24:37,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 3455 transitions. [2022-02-20 18:24:37,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:37,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:37,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:37,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:37,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.579381443298969) internal successors, (1532), 970 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have 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:24:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1532 transitions. [2022-02-20 18:24:37,411 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1532 transitions. Word has length 69 [2022-02-20 18:24:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:37,411 INFO L470 AbstractCegarLoop]: Abstraction has 971 states and 1532 transitions. [2022-02-20 18:24:37,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:24:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1532 transitions. [2022-02-20 18:24:37,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:24:37,413 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:37,413 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, 1, 1, 1, 1, 1] [2022-02-20 18:24:37,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:24:37,414 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:37,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:37,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1614123231, now seen corresponding path program 1 times [2022-02-20 18:24:37,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:37,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513530670] [2022-02-20 18:24:37,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:37,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:37,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {14734#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(39, 2);call #Ultimate.allocInit(12, 3);~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; {14734#true} is VALID [2022-02-20 18:24:37,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {14734#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {14734#true} is VALID [2022-02-20 18:24:37,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {14734#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {14734#true} is VALID [2022-02-20 18:24:37,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {14734#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {14734#true} is VALID [2022-02-20 18:24:37,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {14734#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {14734#true} is VALID [2022-02-20 18:24:37,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {14734#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {14734#true} is VALID [2022-02-20 18:24:37,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {14734#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {14734#true} is VALID [2022-02-20 18:24:37,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {14734#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {14734#true} is VALID [2022-02-20 18:24:37,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {14734#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {14734#true} is VALID [2022-02-20 18:24:37,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {14734#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {14734#true} is VALID [2022-02-20 18:24:37,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {14734#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {14734#true} is VALID [2022-02-20 18:24:37,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {14734#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {14734#true} is VALID [2022-02-20 18:24:37,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {14734#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {14734#true} is VALID [2022-02-20 18:24:37,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {14734#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {14734#true} is VALID [2022-02-20 18:24:37,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {14734#true} assume ~id1~0 != ~id2~0; {14734#true} is VALID [2022-02-20 18:24:37,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {14734#true} assume ~id1~0 != ~id3~0; {14734#true} is VALID [2022-02-20 18:24:37,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {14734#true} assume ~id2~0 != ~id3~0; {14734#true} is VALID [2022-02-20 18:24:37,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {14734#true} assume ~id1~0 >= 0; {14734#true} is VALID [2022-02-20 18:24:37,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {14734#true} assume ~id2~0 >= 0; {14734#true} is VALID [2022-02-20 18:24:37,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {14734#true} assume ~id3~0 >= 0; {14734#true} is VALID [2022-02-20 18:24:37,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {14734#true} assume 0 == ~r1~0 % 256; {14734#true} is VALID [2022-02-20 18:24:37,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {14734#true} assume 0 == ~r2~0 % 256; {14734#true} is VALID [2022-02-20 18:24:37,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {14734#true} assume 0 == ~r3~0 % 256; {14734#true} is VALID [2022-02-20 18:24:37,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {14734#true} assume 0 != init_~r122~0#1 % 256; {14734#true} is VALID [2022-02-20 18:24:37,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {14734#true} assume 0 != init_~r132~0#1 % 256; {14734#true} is VALID [2022-02-20 18:24:37,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {14734#true} assume 0 != init_~r212~0#1 % 256; {14734#true} is VALID [2022-02-20 18:24:37,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {14734#true} assume 0 != init_~r232~0#1 % 256; {14734#true} is VALID [2022-02-20 18:24:37,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {14734#true} assume 0 != init_~r312~0#1 % 256; {14734#true} is VALID [2022-02-20 18:24:37,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {14734#true} assume 0 != init_~r322~0#1 % 256; {14734#true} is VALID [2022-02-20 18:24:37,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {14734#true} assume ~max1~0 == ~id1~0; {14734#true} is VALID [2022-02-20 18:24:37,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {14734#true} assume ~max2~0 == ~id2~0; {14734#true} is VALID [2022-02-20 18:24:37,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {14734#true} assume ~max3~0 == ~id3~0; {14734#true} is VALID [2022-02-20 18:24:37,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {14734#true} assume 0 == ~st1~0; {14736#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:37,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {14736#(<= ~st1~0 0)} assume 0 == ~st2~0; {14736#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:37,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {14736#(<= ~st1~0 0)} assume 0 == ~st3~0; {14736#(<= ~st1~0 0)} is VALID [2022-02-20 18:24:37,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {14736#(<= ~st1~0 0)} assume 0 == ~nl1~0; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,510 INFO L290 TraceCheckUtils]: 41: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,512 INFO L290 TraceCheckUtils]: 45: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,512 INFO L290 TraceCheckUtils]: 46: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,512 INFO L290 TraceCheckUtils]: 47: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 1; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,513 INFO L290 TraceCheckUtils]: 48: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,513 INFO L290 TraceCheckUtils]: 49: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,513 INFO L290 TraceCheckUtils]: 50: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,514 INFO L290 TraceCheckUtils]: 55: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,515 INFO L290 TraceCheckUtils]: 58: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,515 INFO L290 TraceCheckUtils]: 59: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,516 INFO L290 TraceCheckUtils]: 61: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,516 INFO L290 TraceCheckUtils]: 62: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,517 INFO L290 TraceCheckUtils]: 63: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,517 INFO L290 TraceCheckUtils]: 64: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14737#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:24:37,517 INFO L290 TraceCheckUtils]: 65: Hoare triple {14737#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {14735#false} is VALID [2022-02-20 18:24:37,517 INFO L290 TraceCheckUtils]: 66: Hoare triple {14735#false} check_#res#1 := check_~tmp~1#1; {14735#false} is VALID [2022-02-20 18:24:37,518 INFO L290 TraceCheckUtils]: 67: Hoare triple {14735#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {14735#false} is VALID [2022-02-20 18:24:37,518 INFO L290 TraceCheckUtils]: 68: Hoare triple {14735#false} assume 0 == assert_~arg#1 % 256; {14735#false} is VALID [2022-02-20 18:24:37,518 INFO L290 TraceCheckUtils]: 69: Hoare triple {14735#false} assume !false; {14735#false} is VALID [2022-02-20 18:24:37,519 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:24:37,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:37,520 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513530670] [2022-02-20 18:24:37,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513530670] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:37,520 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:37,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:37,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795318146] [2022-02-20 18:24:37,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:37,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:24:37,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:37,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:37,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:37,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:37,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:37,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:37,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:37,559 INFO L87 Difference]: Start difference. First operand 971 states and 1532 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:38,940 INFO L93 Difference]: Finished difference Result 3521 states and 5605 transitions. [2022-02-20 18:24:38,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:38,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:24:38,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:38,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 583 transitions. [2022-02-20 18:24:39,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:39,521 INFO L225 Difference]: With dead ends: 3521 [2022-02-20 18:24:39,522 INFO L226 Difference]: Without dead ends: 2607 [2022-02-20 18:24:39,523 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:24:39,523 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 365 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 660 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:24:39,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 660 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2022-02-20 18:24:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 1780. [2022-02-20 18:24:39,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:39,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2607 states. Second operand has 1780 states, 1779 states have (on average 1.5801011804384486) internal successors, (2811), 1779 states have internal predecessors, (2811), 0 states have call successors, (0), 0 states have 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:24:39,919 INFO L74 IsIncluded]: Start isIncluded. First operand 2607 states. Second operand has 1780 states, 1779 states have (on average 1.5801011804384486) internal successors, (2811), 1779 states have internal predecessors, (2811), 0 states have call successors, (0), 0 states have 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:24:39,922 INFO L87 Difference]: Start difference. First operand 2607 states. Second operand has 1780 states, 1779 states have (on average 1.5801011804384486) internal successors, (2811), 1779 states have internal predecessors, (2811), 0 states have call successors, (0), 0 states have 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:24:40,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:40,107 INFO L93 Difference]: Finished difference Result 2607 states and 4134 transitions. [2022-02-20 18:24:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 4134 transitions. [2022-02-20 18:24:40,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:40,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:40,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 1780 states, 1779 states have (on average 1.5801011804384486) internal successors, (2811), 1779 states have internal predecessors, (2811), 0 states have call successors, (0), 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 2607 states. [2022-02-20 18:24:40,115 INFO L87 Difference]: Start difference. First operand has 1780 states, 1779 states have (on average 1.5801011804384486) internal successors, (2811), 1779 states have internal predecessors, (2811), 0 states have call successors, (0), 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 2607 states. [2022-02-20 18:24:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:40,302 INFO L93 Difference]: Finished difference Result 2607 states and 4134 transitions. [2022-02-20 18:24:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 4134 transitions. [2022-02-20 18:24:40,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:40,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:40,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:40,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1779 states have (on average 1.5801011804384486) internal successors, (2811), 1779 states have internal predecessors, (2811), 0 states have call successors, (0), 0 states have 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:24:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2811 transitions. [2022-02-20 18:24:40,420 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2811 transitions. Word has length 70 [2022-02-20 18:24:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:40,420 INFO L470 AbstractCegarLoop]: Abstraction has 1780 states and 2811 transitions. [2022-02-20 18:24:40,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:24:40,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2811 transitions. [2022-02-20 18:24:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 18:24:40,421 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:40,421 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, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:40,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:24:40,422 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:40,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:40,422 INFO L85 PathProgramCache]: Analyzing trace with hash -252040890, now seen corresponding path program 1 times [2022-02-20 18:24:40,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:40,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608725231] [2022-02-20 18:24:40,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:40,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:40,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {25917#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(39, 2);call #Ultimate.allocInit(12, 3);~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; {25917#true} is VALID [2022-02-20 18:24:40,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {25917#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {25917#true} is VALID [2022-02-20 18:24:40,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {25917#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {25917#true} is VALID [2022-02-20 18:24:40,466 INFO L290 TraceCheckUtils]: 3: Hoare triple {25917#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {25917#true} is VALID [2022-02-20 18:24:40,466 INFO L290 TraceCheckUtils]: 4: Hoare triple {25917#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {25917#true} is VALID [2022-02-20 18:24:40,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {25917#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {25917#true} is VALID [2022-02-20 18:24:40,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {25917#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {25917#true} is VALID [2022-02-20 18:24:40,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {25917#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {25917#true} is VALID [2022-02-20 18:24:40,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {25917#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {25917#true} is VALID [2022-02-20 18:24:40,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {25917#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {25917#true} is VALID [2022-02-20 18:24:40,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {25917#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {25917#true} is VALID [2022-02-20 18:24:40,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {25917#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {25917#true} is VALID [2022-02-20 18:24:40,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {25917#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {25917#true} is VALID [2022-02-20 18:24:40,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {25917#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {25917#true} is VALID [2022-02-20 18:24:40,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {25917#true} assume ~id1~0 != ~id2~0; {25917#true} is VALID [2022-02-20 18:24:40,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {25917#true} assume ~id1~0 != ~id3~0; {25917#true} is VALID [2022-02-20 18:24:40,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {25917#true} assume ~id2~0 != ~id3~0; {25917#true} is VALID [2022-02-20 18:24:40,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {25917#true} assume ~id1~0 >= 0; {25917#true} is VALID [2022-02-20 18:24:40,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {25917#true} assume ~id2~0 >= 0; {25917#true} is VALID [2022-02-20 18:24:40,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {25917#true} assume ~id3~0 >= 0; {25917#true} is VALID [2022-02-20 18:24:40,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {25917#true} assume 0 == ~r1~0 % 256; {25917#true} is VALID [2022-02-20 18:24:40,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {25917#true} assume 0 == ~r2~0 % 256; {25917#true} is VALID [2022-02-20 18:24:40,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {25917#true} assume 0 == ~r3~0 % 256; {25917#true} is VALID [2022-02-20 18:24:40,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {25917#true} assume 0 != init_~r122~0#1 % 256; {25917#true} is VALID [2022-02-20 18:24:40,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {25917#true} assume 0 != init_~r132~0#1 % 256; {25917#true} is VALID [2022-02-20 18:24:40,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {25917#true} assume 0 != init_~r212~0#1 % 256; {25917#true} is VALID [2022-02-20 18:24:40,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {25917#true} assume 0 != init_~r232~0#1 % 256; {25917#true} is VALID [2022-02-20 18:24:40,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {25917#true} assume 0 != init_~r312~0#1 % 256; {25917#true} is VALID [2022-02-20 18:24:40,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {25917#true} assume 0 != init_~r322~0#1 % 256; {25917#true} is VALID [2022-02-20 18:24:40,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {25917#true} assume ~max1~0 == ~id1~0; {25917#true} is VALID [2022-02-20 18:24:40,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {25917#true} assume ~max2~0 == ~id2~0; {25917#true} is VALID [2022-02-20 18:24:40,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {25917#true} assume ~max3~0 == ~id3~0; {25917#true} is VALID [2022-02-20 18:24:40,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {25917#true} assume 0 == ~st1~0; {25917#true} is VALID [2022-02-20 18:24:40,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {25917#true} assume 0 == ~st2~0; {25919#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:40,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {25919#(<= ~st2~0 0)} assume 0 == ~st3~0; {25919#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:40,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {25919#(<= ~st2~0 0)} assume 0 == ~nl1~0; {25919#(<= ~st2~0 0)} is VALID [2022-02-20 18:24:40,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {25919#(<= ~st2~0 0)} assume 0 == ~nl2~0; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,471 INFO L290 TraceCheckUtils]: 37: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,473 INFO L290 TraceCheckUtils]: 43: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,474 INFO L290 TraceCheckUtils]: 46: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 1; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,475 INFO L290 TraceCheckUtils]: 49: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,475 INFO L290 TraceCheckUtils]: 50: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,475 INFO L290 TraceCheckUtils]: 51: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,475 INFO L290 TraceCheckUtils]: 52: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,476 INFO L290 TraceCheckUtils]: 53: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,476 INFO L290 TraceCheckUtils]: 54: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,476 INFO L290 TraceCheckUtils]: 55: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,477 INFO L290 TraceCheckUtils]: 56: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,477 INFO L290 TraceCheckUtils]: 57: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,477 INFO L290 TraceCheckUtils]: 58: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,478 INFO L290 TraceCheckUtils]: 59: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,478 INFO L290 TraceCheckUtils]: 60: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,478 INFO L290 TraceCheckUtils]: 61: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,478 INFO L290 TraceCheckUtils]: 62: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,479 INFO L290 TraceCheckUtils]: 63: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,479 INFO L290 TraceCheckUtils]: 64: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,479 INFO L290 TraceCheckUtils]: 65: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {25920#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:24:40,480 INFO L290 TraceCheckUtils]: 66: Hoare triple {25920#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {25918#false} is VALID [2022-02-20 18:24:40,480 INFO L290 TraceCheckUtils]: 67: Hoare triple {25918#false} check_#res#1 := check_~tmp~1#1; {25918#false} is VALID [2022-02-20 18:24:40,480 INFO L290 TraceCheckUtils]: 68: Hoare triple {25918#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {25918#false} is VALID [2022-02-20 18:24:40,480 INFO L290 TraceCheckUtils]: 69: Hoare triple {25918#false} assume 0 == assert_~arg#1 % 256; {25918#false} is VALID [2022-02-20 18:24:40,480 INFO L290 TraceCheckUtils]: 70: Hoare triple {25918#false} assume !false; {25918#false} is VALID [2022-02-20 18:24:40,481 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:24:40,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:40,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608725231] [2022-02-20 18:24:40,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608725231] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:40,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:40,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:40,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101451486] [2022-02-20 18:24:40,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:24:40,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:40,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:24:40,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:40,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:40,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:40,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:40,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:40,524 INFO L87 Difference]: Start difference. First operand 1780 states and 2811 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:24:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:42,711 INFO L93 Difference]: Finished difference Result 5229 states and 8331 transitions. [2022-02-20 18:24:42,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:42,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:24:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:24:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:24:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:42,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 583 transitions. [2022-02-20 18:24:43,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:43,530 INFO L225 Difference]: With dead ends: 5229 [2022-02-20 18:24:43,531 INFO L226 Difference]: Without dead ends: 3506 [2022-02-20 18:24:43,533 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:24:43,533 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 363 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 661 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:24:43,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 661 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2022-02-20 18:24:44,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 2627. [2022-02-20 18:24:44,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:44,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3506 states. Second operand has 2627 states, 2626 states have (on average 1.578827113480579) internal successors, (4146), 2626 states have internal predecessors, (4146), 0 states have call successors, (0), 0 states have 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:24:44,356 INFO L74 IsIncluded]: Start isIncluded. First operand 3506 states. Second operand has 2627 states, 2626 states have (on average 1.578827113480579) internal successors, (4146), 2626 states have internal predecessors, (4146), 0 states have call successors, (0), 0 states have 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:24:44,367 INFO L87 Difference]: Start difference. First operand 3506 states. Second operand has 2627 states, 2626 states have (on average 1.578827113480579) internal successors, (4146), 2626 states have internal predecessors, (4146), 0 states have call successors, (0), 0 states have 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:24:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:44,743 INFO L93 Difference]: Finished difference Result 3506 states and 5567 transitions. [2022-02-20 18:24:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 5567 transitions. [2022-02-20 18:24:44,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:44,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:44,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 2627 states, 2626 states have (on average 1.578827113480579) internal successors, (4146), 2626 states have internal predecessors, (4146), 0 states have call successors, (0), 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 3506 states. [2022-02-20 18:24:44,752 INFO L87 Difference]: Start difference. First operand has 2627 states, 2626 states have (on average 1.578827113480579) internal successors, (4146), 2626 states have internal predecessors, (4146), 0 states have call successors, (0), 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 3506 states. [2022-02-20 18:24:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:45,144 INFO L93 Difference]: Finished difference Result 3506 states and 5567 transitions. [2022-02-20 18:24:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 5567 transitions. [2022-02-20 18:24:45,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:45,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:45,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:45,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2626 states have (on average 1.578827113480579) internal successors, (4146), 2626 states have internal predecessors, (4146), 0 states have call successors, (0), 0 states have 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:24:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 4146 transitions. [2022-02-20 18:24:45,360 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 4146 transitions. Word has length 71 [2022-02-20 18:24:45,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:45,361 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 4146 transitions. [2022-02-20 18:24:45,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:24:45,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 4146 transitions. [2022-02-20 18:24:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:24:45,363 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:45,363 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:45,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:24:45,363 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:45,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:45,364 INFO L85 PathProgramCache]: Analyzing trace with hash -630566449, now seen corresponding path program 1 times [2022-02-20 18:24:45,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:45,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138166437] [2022-02-20 18:24:45,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:45,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:45,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {41762#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(39, 2);call #Ultimate.allocInit(12, 3);~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; {41762#true} is VALID [2022-02-20 18:24:45,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {41762#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {41762#true} is VALID [2022-02-20 18:24:45,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {41762#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {41762#true} is VALID [2022-02-20 18:24:45,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {41762#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {41762#true} is VALID [2022-02-20 18:24:45,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {41762#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {41762#true} is VALID [2022-02-20 18:24:45,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {41762#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {41762#true} is VALID [2022-02-20 18:24:45,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {41762#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {41762#true} is VALID [2022-02-20 18:24:45,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {41762#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {41762#true} is VALID [2022-02-20 18:24:45,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {41762#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {41762#true} is VALID [2022-02-20 18:24:45,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {41762#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {41762#true} is VALID [2022-02-20 18:24:45,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {41762#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {41762#true} is VALID [2022-02-20 18:24:45,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {41762#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {41762#true} is VALID [2022-02-20 18:24:45,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {41762#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {41762#true} is VALID [2022-02-20 18:24:45,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {41762#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {41762#true} is VALID [2022-02-20 18:24:45,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {41762#true} assume ~id1~0 != ~id2~0; {41762#true} is VALID [2022-02-20 18:24:45,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {41762#true} assume ~id1~0 != ~id3~0; {41762#true} is VALID [2022-02-20 18:24:45,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {41762#true} assume ~id2~0 != ~id3~0; {41762#true} is VALID [2022-02-20 18:24:45,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {41762#true} assume ~id1~0 >= 0; {41762#true} is VALID [2022-02-20 18:24:45,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {41762#true} assume ~id2~0 >= 0; {41762#true} is VALID [2022-02-20 18:24:45,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {41762#true} assume ~id3~0 >= 0; {41762#true} is VALID [2022-02-20 18:24:45,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {41762#true} assume 0 == ~r1~0 % 256; {41762#true} is VALID [2022-02-20 18:24:45,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {41762#true} assume 0 == ~r2~0 % 256; {41762#true} is VALID [2022-02-20 18:24:45,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {41762#true} assume 0 == ~r3~0 % 256; {41762#true} is VALID [2022-02-20 18:24:45,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {41762#true} assume 0 != init_~r122~0#1 % 256; {41762#true} is VALID [2022-02-20 18:24:45,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {41762#true} assume 0 != init_~r132~0#1 % 256; {41762#true} is VALID [2022-02-20 18:24:45,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {41762#true} assume 0 != init_~r212~0#1 % 256; {41762#true} is VALID [2022-02-20 18:24:45,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {41762#true} assume 0 != init_~r232~0#1 % 256; {41762#true} is VALID [2022-02-20 18:24:45,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {41762#true} assume 0 != init_~r312~0#1 % 256; {41762#true} is VALID [2022-02-20 18:24:45,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {41762#true} assume 0 != init_~r322~0#1 % 256; {41762#true} is VALID [2022-02-20 18:24:45,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {41762#true} assume ~max1~0 == ~id1~0; {41762#true} is VALID [2022-02-20 18:24:45,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {41762#true} assume ~max2~0 == ~id2~0; {41762#true} is VALID [2022-02-20 18:24:45,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {41762#true} assume ~max3~0 == ~id3~0; {41762#true} is VALID [2022-02-20 18:24:45,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {41762#true} assume 0 == ~st1~0; {41762#true} is VALID [2022-02-20 18:24:45,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {41762#true} assume 0 == ~st2~0; {41762#true} is VALID [2022-02-20 18:24:45,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {41762#true} assume 0 == ~st3~0; {41762#true} is VALID [2022-02-20 18:24:45,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {41762#true} assume 0 == ~nl1~0; {41762#true} is VALID [2022-02-20 18:24:45,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {41762#true} assume 0 == ~nl2~0; {41762#true} is VALID [2022-02-20 18:24:45,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {41762#true} assume 0 == ~nl3~0; {41762#true} is VALID [2022-02-20 18:24:45,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {41762#true} assume 0 == ~mode1~0 % 256; {41762#true} is VALID [2022-02-20 18:24:45,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {41762#true} assume 0 == ~mode2~0 % 256; {41762#true} is VALID [2022-02-20 18:24:45,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {41762#true} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,407 INFO L290 TraceCheckUtils]: 44: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,407 INFO L290 TraceCheckUtils]: 45: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 1; {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,408 INFO L290 TraceCheckUtils]: 48: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,408 INFO L290 TraceCheckUtils]: 49: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,409 INFO L290 TraceCheckUtils]: 50: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,409 INFO L290 TraceCheckUtils]: 51: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,409 INFO L290 TraceCheckUtils]: 52: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,410 INFO L290 TraceCheckUtils]: 53: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,410 INFO L290 TraceCheckUtils]: 54: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,410 INFO L290 TraceCheckUtils]: 55: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,411 INFO L290 TraceCheckUtils]: 56: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,411 INFO L290 TraceCheckUtils]: 57: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:24:45,411 INFO L290 TraceCheckUtils]: 58: Hoare triple {41764#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256; {41763#false} is VALID [2022-02-20 18:24:45,412 INFO L290 TraceCheckUtils]: 59: Hoare triple {41763#false} assume !(255 == ~r3~0 % 256); {41763#false} is VALID [2022-02-20 18:24:45,412 INFO L290 TraceCheckUtils]: 60: Hoare triple {41763#false} ~r3~0 := 1 + ~r3~0 % 256; {41763#false} is VALID [2022-02-20 18:24:45,412 INFO L290 TraceCheckUtils]: 61: Hoare triple {41763#false} assume !(0 != ~ep13~0 % 256); {41763#false} is VALID [2022-02-20 18:24:45,412 INFO L290 TraceCheckUtils]: 62: Hoare triple {41763#false} assume !(0 != ~ep23~0 % 256); {41763#false} is VALID [2022-02-20 18:24:45,412 INFO L290 TraceCheckUtils]: 63: Hoare triple {41763#false} assume 2 == ~r3~0 % 256; {41763#false} is VALID [2022-02-20 18:24:45,412 INFO L290 TraceCheckUtils]: 64: Hoare triple {41763#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {41763#false} is VALID [2022-02-20 18:24:45,412 INFO L290 TraceCheckUtils]: 65: Hoare triple {41763#false} ~mode3~0 := 0; {41763#false} is VALID [2022-02-20 18:24:45,412 INFO L290 TraceCheckUtils]: 66: Hoare triple {41763#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {41763#false} is VALID [2022-02-20 18:24:45,412 INFO L290 TraceCheckUtils]: 67: Hoare triple {41763#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {41763#false} is VALID [2022-02-20 18:24:45,413 INFO L290 TraceCheckUtils]: 68: Hoare triple {41763#false} check_#res#1 := check_~tmp~1#1; {41763#false} is VALID [2022-02-20 18:24:45,413 INFO L290 TraceCheckUtils]: 69: Hoare triple {41763#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {41763#false} is VALID [2022-02-20 18:24:45,413 INFO L290 TraceCheckUtils]: 70: Hoare triple {41763#false} assume 0 == assert_~arg#1 % 256; {41763#false} is VALID [2022-02-20 18:24:45,413 INFO L290 TraceCheckUtils]: 71: Hoare triple {41763#false} assume !false; {41763#false} is VALID [2022-02-20 18:24:45,413 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:24:45,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:45,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138166437] [2022-02-20 18:24:45,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138166437] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:45,414 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:45,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:24:45,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890047640] [2022-02-20 18:24:45,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:45,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:24:45,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:45,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:24:45,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:45,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:24:45,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:45,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:24:45,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:24:45,457 INFO L87 Difference]: Start difference. First operand 2627 states and 4146 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:24:47,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:47,695 INFO L93 Difference]: Finished difference Result 5332 states and 8434 transitions. [2022-02-20 18:24:47,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:24:47,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:24:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:24:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:24:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:24:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:24:47,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 427 transitions. [2022-02-20 18:24:47,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:48,525 INFO L225 Difference]: With dead ends: 5332 [2022-02-20 18:24:48,525 INFO L226 Difference]: Without dead ends: 3834 [2022-02-20 18:24:48,527 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:24:48,527 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 96 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 415 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:24:48,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 415 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:24:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2022-02-20 18:24:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 3832. [2022-02-20 18:24:49,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:24:49,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3834 states. Second operand has 3832 states, 3831 states have (on average 1.565126598799269) internal successors, (5996), 3831 states have internal predecessors, (5996), 0 states have call successors, (0), 0 states have 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:24:49,813 INFO L74 IsIncluded]: Start isIncluded. First operand 3834 states. Second operand has 3832 states, 3831 states have (on average 1.565126598799269) internal successors, (5996), 3831 states have internal predecessors, (5996), 0 states have call successors, (0), 0 states have 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:24:49,816 INFO L87 Difference]: Start difference. First operand 3834 states. Second operand has 3832 states, 3831 states have (on average 1.565126598799269) internal successors, (5996), 3831 states have internal predecessors, (5996), 0 states have call successors, (0), 0 states have 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:24:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:50,232 INFO L93 Difference]: Finished difference Result 3834 states and 5997 transitions. [2022-02-20 18:24:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 5997 transitions. [2022-02-20 18:24:50,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:50,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:50,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 3832 states, 3831 states have (on average 1.565126598799269) internal successors, (5996), 3831 states have internal predecessors, (5996), 0 states have call successors, (0), 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 3834 states. [2022-02-20 18:24:50,244 INFO L87 Difference]: Start difference. First operand has 3832 states, 3831 states have (on average 1.565126598799269) internal successors, (5996), 3831 states have internal predecessors, (5996), 0 states have call successors, (0), 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 3834 states. [2022-02-20 18:24:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:50,667 INFO L93 Difference]: Finished difference Result 3834 states and 5997 transitions. [2022-02-20 18:24:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 5997 transitions. [2022-02-20 18:24:50,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:24:50,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:24:50,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:24:50,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:24:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3832 states, 3831 states have (on average 1.565126598799269) internal successors, (5996), 3831 states have internal predecessors, (5996), 0 states have call successors, (0), 0 states have 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:24:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 5996 transitions. [2022-02-20 18:24:51,174 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 5996 transitions. Word has length 72 [2022-02-20 18:24:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:24:51,174 INFO L470 AbstractCegarLoop]: Abstraction has 3832 states and 5996 transitions. [2022-02-20 18:24:51,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:24:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 5996 transitions. [2022-02-20 18:24:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:24:51,175 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:24:51,175 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:24:51,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:24:51,176 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:24:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:24:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash -808156936, now seen corresponding path program 1 times [2022-02-20 18:24:51,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:24:51,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459591038] [2022-02-20 18:24:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:24:51,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:24:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:24:51,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {59805#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(39, 2);call #Ultimate.allocInit(12, 3);~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; {59805#true} is VALID [2022-02-20 18:24:51,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {59805#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {59805#true} is VALID [2022-02-20 18:24:51,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {59805#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {59805#true} is VALID [2022-02-20 18:24:51,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {59805#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {59805#true} is VALID [2022-02-20 18:24:51,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {59805#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {59805#true} is VALID [2022-02-20 18:24:51,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {59805#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {59805#true} is VALID [2022-02-20 18:24:51,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {59805#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {59805#true} is VALID [2022-02-20 18:24:51,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {59805#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {59805#true} is VALID [2022-02-20 18:24:51,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {59805#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {59805#true} is VALID [2022-02-20 18:24:51,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {59805#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {59805#true} is VALID [2022-02-20 18:24:51,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {59805#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {59805#true} is VALID [2022-02-20 18:24:51,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {59805#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {59805#true} is VALID [2022-02-20 18:24:51,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {59805#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {59805#true} is VALID [2022-02-20 18:24:51,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {59805#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {59805#true} is VALID [2022-02-20 18:24:51,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {59805#true} assume ~id1~0 != ~id2~0; {59805#true} is VALID [2022-02-20 18:24:51,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {59805#true} assume ~id1~0 != ~id3~0; {59805#true} is VALID [2022-02-20 18:24:51,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {59805#true} assume ~id2~0 != ~id3~0; {59805#true} is VALID [2022-02-20 18:24:51,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {59805#true} assume ~id1~0 >= 0; {59805#true} is VALID [2022-02-20 18:24:51,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {59805#true} assume ~id2~0 >= 0; {59805#true} is VALID [2022-02-20 18:24:51,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {59805#true} assume ~id3~0 >= 0; {59805#true} is VALID [2022-02-20 18:24:51,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {59805#true} assume 0 == ~r1~0 % 256; {59805#true} is VALID [2022-02-20 18:24:51,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {59805#true} assume 0 == ~r2~0 % 256; {59805#true} is VALID [2022-02-20 18:24:51,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {59805#true} assume 0 == ~r3~0 % 256; {59805#true} is VALID [2022-02-20 18:24:51,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {59805#true} assume 0 != init_~r122~0#1 % 256; {59805#true} is VALID [2022-02-20 18:24:51,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {59805#true} assume 0 != init_~r132~0#1 % 256; {59805#true} is VALID [2022-02-20 18:24:51,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {59805#true} assume 0 != init_~r212~0#1 % 256; {59805#true} is VALID [2022-02-20 18:24:51,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {59805#true} assume 0 != init_~r232~0#1 % 256; {59805#true} is VALID [2022-02-20 18:24:51,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {59805#true} assume 0 != init_~r312~0#1 % 256; {59805#true} is VALID [2022-02-20 18:24:51,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {59805#true} assume 0 != init_~r322~0#1 % 256; {59805#true} is VALID [2022-02-20 18:24:51,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {59805#true} assume ~max1~0 == ~id1~0; {59805#true} is VALID [2022-02-20 18:24:51,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {59805#true} assume ~max2~0 == ~id2~0; {59805#true} is VALID [2022-02-20 18:24:51,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {59805#true} assume ~max3~0 == ~id3~0; {59805#true} is VALID [2022-02-20 18:24:51,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {59805#true} assume 0 == ~st1~0; {59805#true} is VALID [2022-02-20 18:24:51,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {59805#true} assume 0 == ~st2~0; {59805#true} is VALID [2022-02-20 18:24:51,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {59805#true} assume 0 == ~st3~0; {59807#(<= ~st3~0 0)} is VALID [2022-02-20 18:24:51,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {59807#(<= ~st3~0 0)} assume 0 == ~nl1~0; {59807#(<= ~st3~0 0)} is VALID [2022-02-20 18:24:51,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {59807#(<= ~st3~0 0)} assume 0 == ~nl2~0; {59807#(<= ~st3~0 0)} is VALID [2022-02-20 18:24:51,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {59807#(<= ~st3~0 0)} assume 0 == ~nl3~0; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,229 INFO L290 TraceCheckUtils]: 38: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,229 INFO L290 TraceCheckUtils]: 39: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,229 INFO L290 TraceCheckUtils]: 40: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,230 INFO L290 TraceCheckUtils]: 41: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,230 INFO L290 TraceCheckUtils]: 42: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,230 INFO L290 TraceCheckUtils]: 43: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,232 INFO L290 TraceCheckUtils]: 49: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,232 INFO L290 TraceCheckUtils]: 50: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,233 INFO L290 TraceCheckUtils]: 51: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,233 INFO L290 TraceCheckUtils]: 52: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,234 INFO L290 TraceCheckUtils]: 55: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,236 INFO L290 TraceCheckUtils]: 59: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,236 INFO L290 TraceCheckUtils]: 60: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,236 INFO L290 TraceCheckUtils]: 61: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,237 INFO L290 TraceCheckUtils]: 62: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,237 INFO L290 TraceCheckUtils]: 63: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,238 INFO L290 TraceCheckUtils]: 64: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,238 INFO L290 TraceCheckUtils]: 65: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,238 INFO L290 TraceCheckUtils]: 66: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {59808#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:24:51,239 INFO L290 TraceCheckUtils]: 67: Hoare triple {59808#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {59806#false} is VALID [2022-02-20 18:24:51,239 INFO L290 TraceCheckUtils]: 68: Hoare triple {59806#false} check_#res#1 := check_~tmp~1#1; {59806#false} is VALID [2022-02-20 18:24:51,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {59806#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {59806#false} is VALID [2022-02-20 18:24:51,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {59806#false} assume 0 == assert_~arg#1 % 256; {59806#false} is VALID [2022-02-20 18:24:51,239 INFO L290 TraceCheckUtils]: 71: Hoare triple {59806#false} assume !false; {59806#false} is VALID [2022-02-20 18:24:51,240 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:24:51,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:24:51,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459591038] [2022-02-20 18:24:51,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459591038] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:24:51,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:24:51,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:24:51,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850166097] [2022-02-20 18:24:51,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:24:51,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:24:51,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:24:51,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:24:51,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:24:51,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:24:51,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:24:51,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:24:51,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:24:51,283 INFO L87 Difference]: Start difference. First operand 3832 states and 5996 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:24:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:24:58,658 INFO L93 Difference]: Finished difference Result 11784 states and 18557 transitions. [2022-02-20 18:24:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:24:58,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:24:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:24:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:24:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:24:58,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-02-20 18:24:58,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 583 transitions. [2022-02-20 18:24:58,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:01,434 INFO L225 Difference]: With dead ends: 11784 [2022-02-20 18:25:01,434 INFO L226 Difference]: Without dead ends: 8140 [2022-02-20 18:25:01,437 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:25:01,438 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 361 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 661 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:25:01,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 661 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:25:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8140 states. [2022-02-20 18:25:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8140 to 5964. [2022-02-20 18:25:03,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:03,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8140 states. Second operand has 5964 states, 5963 states have (on average 1.5609592487003185) internal successors, (9308), 5963 states have internal predecessors, (9308), 0 states have call successors, (0), 0 states have 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:25:03,660 INFO L74 IsIncluded]: Start isIncluded. First operand 8140 states. Second operand has 5964 states, 5963 states have (on average 1.5609592487003185) internal successors, (9308), 5963 states have internal predecessors, (9308), 0 states have call successors, (0), 0 states have 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:25:03,667 INFO L87 Difference]: Start difference. First operand 8140 states. Second operand has 5964 states, 5963 states have (on average 1.5609592487003185) internal successors, (9308), 5963 states have internal predecessors, (9308), 0 states have call successors, (0), 0 states have 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:25:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:05,478 INFO L93 Difference]: Finished difference Result 8140 states and 12762 transitions. [2022-02-20 18:25:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 8140 states and 12762 transitions. [2022-02-20 18:25:05,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:05,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:05,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 5964 states, 5963 states have (on average 1.5609592487003185) internal successors, (9308), 5963 states have internal predecessors, (9308), 0 states have call successors, (0), 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 8140 states. [2022-02-20 18:25:05,494 INFO L87 Difference]: Start difference. First operand has 5964 states, 5963 states have (on average 1.5609592487003185) internal successors, (9308), 5963 states have internal predecessors, (9308), 0 states have call successors, (0), 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 8140 states. [2022-02-20 18:25:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:07,394 INFO L93 Difference]: Finished difference Result 8140 states and 12762 transitions. [2022-02-20 18:25:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 8140 states and 12762 transitions. [2022-02-20 18:25:07,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:07,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:07,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:25:07,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:25:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5964 states, 5963 states have (on average 1.5609592487003185) internal successors, (9308), 5963 states have internal predecessors, (9308), 0 states have call successors, (0), 0 states have 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:25:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5964 states to 5964 states and 9308 transitions. [2022-02-20 18:25:08,457 INFO L78 Accepts]: Start accepts. Automaton has 5964 states and 9308 transitions. Word has length 72 [2022-02-20 18:25:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:25:08,457 INFO L470 AbstractCegarLoop]: Abstraction has 5964 states and 9308 transitions. [2022-02-20 18:25:08,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:25:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5964 states and 9308 transitions. [2022-02-20 18:25:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:25:08,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:25:08,458 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:25:08,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:25:08,458 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:25:08,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:25:08,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1968035874, now seen corresponding path program 1 times [2022-02-20 18:25:08,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:25:08,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081973701] [2022-02-20 18:25:08,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:25:08,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:25:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:25:08,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {96258#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(39, 2);call #Ultimate.allocInit(12, 3);~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; {96258#true} is VALID [2022-02-20 18:25:08,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {96258#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {96258#true} is VALID [2022-02-20 18:25:08,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {96258#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {96258#true} is VALID [2022-02-20 18:25:08,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {96258#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {96258#true} is VALID [2022-02-20 18:25:08,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {96258#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {96258#true} is VALID [2022-02-20 18:25:08,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {96258#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {96258#true} is VALID [2022-02-20 18:25:08,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {96258#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {96258#true} is VALID [2022-02-20 18:25:08,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {96258#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {96258#true} is VALID [2022-02-20 18:25:08,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {96258#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {96258#true} is VALID [2022-02-20 18:25:08,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {96258#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {96258#true} is VALID [2022-02-20 18:25:08,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {96258#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {96258#true} is VALID [2022-02-20 18:25:08,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {96258#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {96258#true} is VALID [2022-02-20 18:25:08,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {96258#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {96258#true} is VALID [2022-02-20 18:25:08,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {96258#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {96258#true} is VALID [2022-02-20 18:25:08,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {96258#true} assume ~id1~0 != ~id2~0; {96258#true} is VALID [2022-02-20 18:25:08,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {96258#true} assume ~id1~0 != ~id3~0; {96258#true} is VALID [2022-02-20 18:25:08,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {96258#true} assume ~id2~0 != ~id3~0; {96258#true} is VALID [2022-02-20 18:25:08,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {96258#true} assume ~id1~0 >= 0; {96258#true} is VALID [2022-02-20 18:25:08,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {96258#true} assume ~id2~0 >= 0; {96258#true} is VALID [2022-02-20 18:25:08,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {96258#true} assume ~id3~0 >= 0; {96258#true} is VALID [2022-02-20 18:25:08,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {96258#true} assume 0 == ~r1~0 % 256; {96258#true} is VALID [2022-02-20 18:25:08,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {96258#true} assume 0 == ~r2~0 % 256; {96258#true} is VALID [2022-02-20 18:25:08,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {96258#true} assume 0 == ~r3~0 % 256; {96258#true} is VALID [2022-02-20 18:25:08,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {96258#true} assume 0 != init_~r122~0#1 % 256; {96258#true} is VALID [2022-02-20 18:25:08,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {96258#true} assume 0 != init_~r132~0#1 % 256; {96258#true} is VALID [2022-02-20 18:25:08,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {96258#true} assume 0 != init_~r212~0#1 % 256; {96258#true} is VALID [2022-02-20 18:25:08,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {96258#true} assume 0 != init_~r232~0#1 % 256; {96258#true} is VALID [2022-02-20 18:25:08,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {96258#true} assume 0 != init_~r312~0#1 % 256; {96258#true} is VALID [2022-02-20 18:25:08,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {96258#true} assume 0 != init_~r322~0#1 % 256; {96258#true} is VALID [2022-02-20 18:25:08,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {96258#true} assume ~max1~0 == ~id1~0; {96258#true} is VALID [2022-02-20 18:25:08,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {96258#true} assume ~max2~0 == ~id2~0; {96258#true} is VALID [2022-02-20 18:25:08,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {96258#true} assume ~max3~0 == ~id3~0; {96258#true} is VALID [2022-02-20 18:25:08,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {96258#true} assume 0 == ~st1~0; {96258#true} is VALID [2022-02-20 18:25:08,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {96258#true} assume 0 == ~st2~0; {96258#true} is VALID [2022-02-20 18:25:08,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {96258#true} assume 0 == ~st3~0; {96258#true} is VALID [2022-02-20 18:25:08,492 INFO L290 TraceCheckUtils]: 35: Hoare triple {96258#true} assume 0 == ~nl1~0; {96258#true} is VALID [2022-02-20 18:25:08,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {96258#true} assume 0 == ~nl2~0; {96258#true} is VALID [2022-02-20 18:25:08,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {96258#true} assume 0 == ~nl3~0; {96258#true} is VALID [2022-02-20 18:25:08,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {96258#true} assume 0 == ~mode1~0 % 256; {96258#true} is VALID [2022-02-20 18:25:08,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {96258#true} assume 0 == ~mode2~0 % 256; {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:08,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:08,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:08,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:08,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:08,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:08,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:08,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:08,495 INFO L290 TraceCheckUtils]: 47: Hoare triple {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 1; {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:08,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:08,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:08,496 INFO L290 TraceCheckUtils]: 50: Hoare triple {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:08,497 INFO L290 TraceCheckUtils]: 51: Hoare triple {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:25:08,497 INFO L290 TraceCheckUtils]: 52: Hoare triple {96260#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256; {96259#false} is VALID [2022-02-20 18:25:08,497 INFO L290 TraceCheckUtils]: 53: Hoare triple {96259#false} assume !(255 == ~r2~0 % 256); {96259#false} is VALID [2022-02-20 18:25:08,497 INFO L290 TraceCheckUtils]: 54: Hoare triple {96259#false} ~r2~0 := 1 + ~r2~0 % 256; {96259#false} is VALID [2022-02-20 18:25:08,497 INFO L290 TraceCheckUtils]: 55: Hoare triple {96259#false} assume !(0 != ~ep12~0 % 256); {96259#false} is VALID [2022-02-20 18:25:08,498 INFO L290 TraceCheckUtils]: 56: Hoare triple {96259#false} assume !(0 != ~ep32~0 % 256); {96259#false} is VALID [2022-02-20 18:25:08,498 INFO L290 TraceCheckUtils]: 57: Hoare triple {96259#false} assume 2 == ~r2~0 % 256; {96259#false} is VALID [2022-02-20 18:25:08,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {96259#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {96259#false} is VALID [2022-02-20 18:25:08,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {96259#false} ~mode2~0 := 0; {96259#false} is VALID [2022-02-20 18:25:08,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {96259#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {96259#false} is VALID [2022-02-20 18:25:08,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {96259#false} assume !(0 != ~mode3~0 % 256); {96259#false} is VALID [2022-02-20 18:25:08,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {96259#false} assume ~r3~0 % 256 < 2; {96259#false} is VALID [2022-02-20 18:25:08,498 INFO L290 TraceCheckUtils]: 63: Hoare triple {96259#false} assume !(0 != ~ep31~0 % 256); {96259#false} is VALID [2022-02-20 18:25:08,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {96259#false} assume !(0 != ~ep32~0 % 256); {96259#false} is VALID [2022-02-20 18:25:08,499 INFO L290 TraceCheckUtils]: 65: Hoare triple {96259#false} ~mode3~0 := 1; {96259#false} is VALID [2022-02-20 18:25:08,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {96259#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {96259#false} is VALID [2022-02-20 18:25:08,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {96259#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {96259#false} is VALID [2022-02-20 18:25:08,499 INFO L290 TraceCheckUtils]: 68: Hoare triple {96259#false} check_#res#1 := check_~tmp~1#1; {96259#false} is VALID [2022-02-20 18:25:08,499 INFO L290 TraceCheckUtils]: 69: Hoare triple {96259#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {96259#false} is VALID [2022-02-20 18:25:08,499 INFO L290 TraceCheckUtils]: 70: Hoare triple {96259#false} assume 0 == assert_~arg#1 % 256; {96259#false} is VALID [2022-02-20 18:25:08,499 INFO L290 TraceCheckUtils]: 71: Hoare triple {96259#false} assume !false; {96259#false} is VALID [2022-02-20 18:25:08,499 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:25:08,500 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:25:08,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081973701] [2022-02-20 18:25:08,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081973701] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:25:08,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:25:08,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:25:08,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029353142] [2022-02-20 18:25:08,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:25:08,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:25:08,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:25:08,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:25:08,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:08,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:25:08,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:25:08,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:25:08,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:25:08,539 INFO L87 Difference]: Start difference. First operand 5964 states and 9308 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:25:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:17,804 INFO L93 Difference]: Finished difference Result 13002 states and 20346 transitions. [2022-02-20 18:25:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:25:17,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:25:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:25:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:25:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:25:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:25:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 18:25:17,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 427 transitions. [2022-02-20 18:25:18,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:20,761 INFO L225 Difference]: With dead ends: 13002 [2022-02-20 18:25:20,761 INFO L226 Difference]: Without dead ends: 8809 [2022-02-20 18:25:20,764 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:25:20,765 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 102 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 443 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:25:20,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 443 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:25:20,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8809 states. [2022-02-20 18:25:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8809 to 8807. [2022-02-20 18:25:24,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:25:24,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8809 states. Second operand has 8807 states, 8806 states have (on average 1.5470133999545763) internal successors, (13623), 8806 states have internal predecessors, (13623), 0 states have call successors, (0), 0 states have 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:25:24,259 INFO L74 IsIncluded]: Start isIncluded. First operand 8809 states. Second operand has 8807 states, 8806 states have (on average 1.5470133999545763) internal successors, (13623), 8806 states have internal predecessors, (13623), 0 states have call successors, (0), 0 states have 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:25:24,264 INFO L87 Difference]: Start difference. First operand 8809 states. Second operand has 8807 states, 8806 states have (on average 1.5470133999545763) internal successors, (13623), 8806 states have internal predecessors, (13623), 0 states have call successors, (0), 0 states have 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:25:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:26,265 INFO L93 Difference]: Finished difference Result 8809 states and 13624 transitions. [2022-02-20 18:25:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 8809 states and 13624 transitions. [2022-02-20 18:25:26,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:26,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:26,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 8807 states, 8806 states have (on average 1.5470133999545763) internal successors, (13623), 8806 states have internal predecessors, (13623), 0 states have call successors, (0), 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 8809 states. [2022-02-20 18:25:26,284 INFO L87 Difference]: Start difference. First operand has 8807 states, 8806 states have (on average 1.5470133999545763) internal successors, (13623), 8806 states have internal predecessors, (13623), 0 states have call successors, (0), 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 8809 states. [2022-02-20 18:25:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:25:28,498 INFO L93 Difference]: Finished difference Result 8809 states and 13624 transitions. [2022-02-20 18:25:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 8809 states and 13624 transitions. [2022-02-20 18:25:28,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:25:28,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:25:28,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:25:28,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:25:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8807 states, 8806 states have (on average 1.5470133999545763) internal successors, (13623), 8806 states have internal predecessors, (13623), 0 states have call successors, (0), 0 states have 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:25:30,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8807 states to 8807 states and 13623 transitions. [2022-02-20 18:25:30,969 INFO L78 Accepts]: Start accepts. Automaton has 8807 states and 13623 transitions. Word has length 72 [2022-02-20 18:25:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:25:30,970 INFO L470 AbstractCegarLoop]: Abstraction has 8807 states and 13623 transitions. [2022-02-20 18:25:30,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:25:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 8807 states and 13623 transitions. [2022-02-20 18:25:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:25:30,970 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:25:30,971 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:25:30,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:25:30,971 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:25:30,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:25:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash 952039085, now seen corresponding path program 1 times [2022-02-20 18:25:30,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:25:30,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334593401] [2022-02-20 18:25:30,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:25:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:25:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:25:31,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {138927#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(39, 2);call #Ultimate.allocInit(12, 3);~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; {138927#true} is VALID [2022-02-20 18:25:31,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {138927#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {138927#true} is VALID [2022-02-20 18:25:31,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {138927#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {138927#true} is VALID [2022-02-20 18:25:31,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {138927#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {138927#true} is VALID [2022-02-20 18:25:31,010 INFO L290 TraceCheckUtils]: 4: Hoare triple {138927#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {138927#true} is VALID [2022-02-20 18:25:31,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {138927#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {138927#true} is VALID [2022-02-20 18:25:31,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {138927#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {138927#true} is VALID [2022-02-20 18:25:31,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {138927#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {138927#true} is VALID [2022-02-20 18:25:31,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {138927#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {138927#true} is VALID [2022-02-20 18:25:31,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {138927#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {138927#true} is VALID [2022-02-20 18:25:31,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {138927#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {138927#true} is VALID [2022-02-20 18:25:31,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {138927#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {138927#true} is VALID [2022-02-20 18:25:31,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {138927#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {138927#true} is VALID [2022-02-20 18:25:31,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {138927#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {138927#true} is VALID [2022-02-20 18:25:31,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {138927#true} assume ~id1~0 != ~id2~0; {138927#true} is VALID [2022-02-20 18:25:31,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {138927#true} assume ~id1~0 != ~id3~0; {138927#true} is VALID [2022-02-20 18:25:31,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {138927#true} assume ~id2~0 != ~id3~0; {138927#true} is VALID [2022-02-20 18:25:31,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {138927#true} assume ~id1~0 >= 0; {138927#true} is VALID [2022-02-20 18:25:31,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {138927#true} assume ~id2~0 >= 0; {138927#true} is VALID [2022-02-20 18:25:31,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {138927#true} assume ~id3~0 >= 0; {138927#true} is VALID [2022-02-20 18:25:31,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {138927#true} assume 0 == ~r1~0 % 256; {138927#true} is VALID [2022-02-20 18:25:31,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {138927#true} assume 0 == ~r2~0 % 256; {138927#true} is VALID [2022-02-20 18:25:31,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {138927#true} assume 0 == ~r3~0 % 256; {138927#true} is VALID [2022-02-20 18:25:31,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {138927#true} assume 0 != init_~r122~0#1 % 256; {138927#true} is VALID [2022-02-20 18:25:31,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {138927#true} assume 0 != init_~r132~0#1 % 256; {138927#true} is VALID [2022-02-20 18:25:31,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {138927#true} assume 0 != init_~r212~0#1 % 256; {138927#true} is VALID [2022-02-20 18:25:31,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {138927#true} assume 0 != init_~r232~0#1 % 256; {138927#true} is VALID [2022-02-20 18:25:31,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {138927#true} assume 0 != init_~r312~0#1 % 256; {138927#true} is VALID [2022-02-20 18:25:31,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {138927#true} assume 0 != init_~r322~0#1 % 256; {138927#true} is VALID [2022-02-20 18:25:31,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {138927#true} assume ~max1~0 == ~id1~0; {138927#true} is VALID [2022-02-20 18:25:31,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {138927#true} assume ~max2~0 == ~id2~0; {138927#true} is VALID [2022-02-20 18:25:31,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {138927#true} assume ~max3~0 == ~id3~0; {138927#true} is VALID [2022-02-20 18:25:31,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {138927#true} assume 0 == ~st1~0; {138927#true} is VALID [2022-02-20 18:25:31,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {138927#true} assume 0 == ~st2~0; {138927#true} is VALID [2022-02-20 18:25:31,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {138927#true} assume 0 == ~st3~0; {138927#true} is VALID [2022-02-20 18:25:31,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {138927#true} assume 0 == ~nl1~0; {138927#true} is VALID [2022-02-20 18:25:31,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {138927#true} assume 0 == ~nl2~0; {138927#true} is VALID [2022-02-20 18:25:31,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {138927#true} assume 0 == ~nl3~0; {138927#true} is VALID [2022-02-20 18:25:31,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {138927#true} assume 0 == ~mode1~0 % 256; {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:31,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:31,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:31,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:31,015 INFO L290 TraceCheckUtils]: 42: Hoare triple {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:31,015 INFO L290 TraceCheckUtils]: 43: Hoare triple {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:31,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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_~i2~0#1 := 0; {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:31,016 INFO L290 TraceCheckUtils]: 45: Hoare triple {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:25:31,016 INFO L290 TraceCheckUtils]: 46: Hoare triple {138929#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {138928#false} is VALID [2022-02-20 18:25:31,016 INFO L290 TraceCheckUtils]: 47: Hoare triple {138928#false} assume !(255 == ~r1~0 % 256); {138928#false} is VALID [2022-02-20 18:25:31,017 INFO L290 TraceCheckUtils]: 48: Hoare triple {138928#false} ~r1~0 := 1 + ~r1~0 % 256; {138928#false} is VALID [2022-02-20 18:25:31,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {138928#false} assume !(0 != ~ep21~0 % 256); {138928#false} is VALID [2022-02-20 18:25:31,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {138928#false} assume !(0 != ~ep31~0 % 256); {138928#false} is VALID [2022-02-20 18:25:31,017 INFO L290 TraceCheckUtils]: 51: Hoare triple {138928#false} assume 2 == ~r1~0 % 256; {138928#false} is VALID [2022-02-20 18:25:31,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {138928#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {138928#false} is VALID [2022-02-20 18:25:31,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {138928#false} ~mode1~0 := 0; {138928#false} is VALID [2022-02-20 18:25:31,017 INFO L290 TraceCheckUtils]: 54: Hoare triple {138928#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {138928#false} is VALID [2022-02-20 18:25:31,017 INFO L290 TraceCheckUtils]: 55: Hoare triple {138928#false} assume !(0 != ~mode2~0 % 256); {138928#false} is VALID [2022-02-20 18:25:31,017 INFO L290 TraceCheckUtils]: 56: Hoare triple {138928#false} assume ~r2~0 % 256 < 2; {138928#false} is VALID [2022-02-20 18:25:31,017 INFO L290 TraceCheckUtils]: 57: Hoare triple {138928#false} assume !(0 != ~ep21~0 % 256); {138928#false} is VALID [2022-02-20 18:25:31,018 INFO L290 TraceCheckUtils]: 58: Hoare triple {138928#false} assume !(0 != ~ep23~0 % 256); {138928#false} is VALID [2022-02-20 18:25:31,018 INFO L290 TraceCheckUtils]: 59: Hoare triple {138928#false} ~mode2~0 := 1; {138928#false} is VALID [2022-02-20 18:25:31,018 INFO L290 TraceCheckUtils]: 60: Hoare triple {138928#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {138928#false} is VALID [2022-02-20 18:25:31,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {138928#false} assume !(0 != ~mode3~0 % 256); {138928#false} is VALID [2022-02-20 18:25:31,018 INFO L290 TraceCheckUtils]: 62: Hoare triple {138928#false} assume ~r3~0 % 256 < 2; {138928#false} is VALID [2022-02-20 18:25:31,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {138928#false} assume !(0 != ~ep31~0 % 256); {138928#false} is VALID [2022-02-20 18:25:31,018 INFO L290 TraceCheckUtils]: 64: Hoare triple {138928#false} assume !(0 != ~ep32~0 % 256); {138928#false} is VALID [2022-02-20 18:25:31,018 INFO L290 TraceCheckUtils]: 65: Hoare triple {138928#false} ~mode3~0 := 1; {138928#false} is VALID [2022-02-20 18:25:31,018 INFO L290 TraceCheckUtils]: 66: Hoare triple {138928#false} assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {138928#false} is VALID [2022-02-20 18:25:31,018 INFO L290 TraceCheckUtils]: 67: Hoare triple {138928#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {138928#false} is VALID [2022-02-20 18:25:31,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {138928#false} check_#res#1 := check_~tmp~1#1; {138928#false} is VALID [2022-02-20 18:25:31,019 INFO L290 TraceCheckUtils]: 69: Hoare triple {138928#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret38#1 && main_#t~ret38#1 <= 2147483647;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {138928#false} is VALID [2022-02-20 18:25:31,019 INFO L290 TraceCheckUtils]: 70: Hoare triple {138928#false} assume 0 == assert_~arg#1 % 256; {138928#false} is VALID [2022-02-20 18:25:31,019 INFO L290 TraceCheckUtils]: 71: Hoare triple {138928#false} assume !false; {138928#false} is VALID [2022-02-20 18:25:31,019 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:25:31,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:25:31,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334593401] [2022-02-20 18:25:31,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334593401] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:25:31,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:25:31,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:25:31,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064709370] [2022-02-20 18:25:31,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:25:31,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:25:31,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:25:31,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:25:31,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:25:31,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:25:31,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:25:31,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:25:31,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:25:31,056 INFO L87 Difference]: Start difference. First operand 8807 states and 13623 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)