./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5c011d5a0fba56387056dfb1e4fd33cceb66b52965c25e0a625e04747833af64 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:39:12,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:39:12,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:39:12,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:39:12,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:39:12,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:39:12,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:39:12,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:39:12,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:39:12,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:39:12,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:39:12,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:39:12,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:39:12,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:39:12,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:39:12,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:39:12,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:39:12,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:39:12,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:39:12,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:39:12,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:39:12,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:39:12,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:39:12,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:39:12,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:39:12,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:39:12,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:39:12,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:39:12,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:39:12,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:39:12,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:39:12,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:39:12,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:39:12,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:39:12,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:39:12,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:39:12,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:39:12,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:39:12,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:39:12,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:39:12,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:39:12,338 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:39:12,361 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:39:12,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:39:12,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:39:12,363 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:39:12,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:39:12,364 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:39:12,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:39:12,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:39:12,365 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:39:12,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:39:12,366 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:39:12,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:39:12,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:39:12,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:39:12,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:39:12,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:39:12,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:39:12,366 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:39:12,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:39:12,367 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:39:12,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:39:12,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:39:12,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:39:12,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:39:12,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:39:12,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:39:12,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:39:12,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:39:12,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:39:12,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:39:12,368 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:39:12,368 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:39:12,369 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:39:12,369 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 -> 5c011d5a0fba56387056dfb1e4fd33cceb66b52965c25e0a625e04747833af64 [2022-02-20 18:39:12,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:39:12,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:39:12,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:39:12,591 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:39:12,591 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:39:12,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:39:12,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af8fc916/0d84ce95d2114c6abbd7d39feb918f46/FLAG427c81566 [2022-02-20 18:39:13,034 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:39:13,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:39:13,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af8fc916/0d84ce95d2114c6abbd7d39feb918f46/FLAG427c81566 [2022-02-20 18:39:13,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af8fc916/0d84ce95d2114c6abbd7d39feb918f46 [2022-02-20 18:39:13,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:39:13,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:39:13,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:39:13,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:39:13,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:39:13,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:39:13" (1/1) ... [2022-02-20 18:39:13,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774a49f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:13, skipping insertion in model container [2022-02-20 18:39:13,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:39:13" (1/1) ... [2022-02-20 18:39:13,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:39:13,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:39:13,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7349,7362] [2022-02-20 18:39:13,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:39:13,370 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:39:13,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7349,7362] [2022-02-20 18:39:13,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:39:13,422 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:39:13,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:13 WrapperNode [2022-02-20 18:39:13,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:39:13,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:39:13,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:39:13,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:39:13,428 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:39:13" (1/1) ... [2022-02-20 18:39:13,435 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:39:13" (1/1) ... [2022-02-20 18:39:13,479 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 590 [2022-02-20 18:39:13,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:39:13,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:39:13,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:39:13,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:39:13,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:13" (1/1) ... [2022-02-20 18:39:13,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:13" (1/1) ... [2022-02-20 18:39:13,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:13" (1/1) ... [2022-02-20 18:39:13,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:13" (1/1) ... [2022-02-20 18:39:13,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:13" (1/1) ... [2022-02-20 18:39:13,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:13" (1/1) ... [2022-02-20 18:39:13,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:13" (1/1) ... [2022-02-20 18:39:13,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:39:13,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:39:13,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:39:13,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:39:13,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:13" (1/1) ... [2022-02-20 18:39:13,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:39:13,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:39:13,563 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:39:13,578 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:39:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:39:13,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:39:13,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:39:13,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:39:13,723 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:39:13,724 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:39:14,245 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:39:14,252 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:39:14,253 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:39:14,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:39:14 BoogieIcfgContainer [2022-02-20 18:39:14,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:39:14,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:39:14,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:39:14,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:39:14,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:39:13" (1/3) ... [2022-02-20 18:39:14,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7a6908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:39:14, skipping insertion in model container [2022-02-20 18:39:14,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:39:13" (2/3) ... [2022-02-20 18:39:14,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7a6908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:39:14, skipping insertion in model container [2022-02-20 18:39:14,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:39:14" (3/3) ... [2022-02-20 18:39:14,259 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:39:14,263 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:39:14,263 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:39:14,289 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:39:14,294 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:39:14,295 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:39:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 138 states have (on average 1.7608695652173914) internal successors, (243), 139 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:39:14,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:14,318 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] [2022-02-20 18:39:14,319 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:14,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:14,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1890044597, now seen corresponding path program 1 times [2022-02-20 18:39:14,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:14,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296085779] [2022-02-20 18:39:14,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:14,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {143#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1790~0 := 0;~__return_1921~0 := 0; {143#true} is VALID [2022-02-20 18:39:14,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {143#true} is VALID [2022-02-20 18:39:14,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {143#true} is VALID [2022-02-20 18:39:14,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {143#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {143#true} is VALID [2022-02-20 18:39:14,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {143#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {143#true} is VALID [2022-02-20 18:39:14,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {143#true} is VALID [2022-02-20 18:39:14,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {143#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {143#true} is VALID [2022-02-20 18:39:14,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {143#true} is VALID [2022-02-20 18:39:14,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {143#true} is VALID [2022-02-20 18:39:14,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {143#true} is VALID [2022-02-20 18:39:14,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {143#true} is VALID [2022-02-20 18:39:14,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {143#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {143#true} is VALID [2022-02-20 18:39:14,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {143#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {143#true} is VALID [2022-02-20 18:39:14,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {143#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {143#true} is VALID [2022-02-20 18:39:14,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {143#true} assume ~id1~0 != ~id2~0; {143#true} is VALID [2022-02-20 18:39:14,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {143#true} assume ~id1~0 != ~id3~0; {143#true} is VALID [2022-02-20 18:39:14,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {143#true} assume ~id2~0 != ~id3~0; {143#true} is VALID [2022-02-20 18:39:14,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {143#true} assume ~id1~0 >= 0; {143#true} is VALID [2022-02-20 18:39:14,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {143#true} assume ~id2~0 >= 0; {143#true} is VALID [2022-02-20 18:39:14,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {143#true} assume ~id3~0 >= 0; {143#true} is VALID [2022-02-20 18:39:14,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {143#true} assume 0 == ~r1~0 % 256; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r122~0#1 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r132~0#1 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r212~0#1 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r232~0#1 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r312~0#1 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r322~0#1 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,667 INFO L290 TraceCheckUtils]: 36: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,667 INFO L290 TraceCheckUtils]: 37: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,668 INFO L290 TraceCheckUtils]: 40: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1790~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1790~0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256); {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:39:14,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {145#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 2); {144#false} is VALID [2022-02-20 18:39:14,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {144#false} ~mode1~0 := 1; {144#false} is VALID [2022-02-20 18:39:14,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {144#false} assume !!(0 == ~mode2~0 % 256); {144#false} is VALID [2022-02-20 18:39:14,671 INFO L290 TraceCheckUtils]: 46: Hoare triple {144#false} assume !(~r2~0 % 256 < 2); {144#false} is VALID [2022-02-20 18:39:14,671 INFO L290 TraceCheckUtils]: 47: Hoare triple {144#false} ~mode2~0 := 1; {144#false} is VALID [2022-02-20 18:39:14,671 INFO L290 TraceCheckUtils]: 48: Hoare triple {144#false} assume !!(0 == ~mode3~0 % 256); {144#false} is VALID [2022-02-20 18:39:14,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {144#false} assume !(~r3~0 % 256 < 2); {144#false} is VALID [2022-02-20 18:39:14,674 INFO L290 TraceCheckUtils]: 50: Hoare triple {144#false} ~mode3~0 := 1; {144#false} is VALID [2022-02-20 18:39:14,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {144#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {144#false} is VALID [2022-02-20 18:39:14,675 INFO L290 TraceCheckUtils]: 52: Hoare triple {144#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {144#false} is VALID [2022-02-20 18:39:14,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {144#false} ~__return_1921~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1921~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {144#false} is VALID [2022-02-20 18:39:14,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {144#false} assume 0 == main_~assert__arg~0#1 % 256; {144#false} is VALID [2022-02-20 18:39:14,678 INFO L290 TraceCheckUtils]: 55: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-02-20 18:39:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:14,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:14,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296085779] [2022-02-20 18:39:14,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296085779] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:14,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:14,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:14,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856914702] [2022-02-20 18:39:14,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:14,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:39:14,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:14,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:14,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:14,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:14,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:14,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:14,763 INFO L87 Difference]: Start difference. First operand has 140 states, 138 states have (on average 1.7608695652173914) internal successors, (243), 139 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:15,119 INFO L93 Difference]: Finished difference Result 303 states and 512 transitions. [2022-02-20 18:39:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:39:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:39:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-02-20 18:39:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-02-20 18:39:15,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 512 transitions. [2022-02-20 18:39:15,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 512 edges. 512 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:15,516 INFO L225 Difference]: With dead ends: 303 [2022-02-20 18:39:15,519 INFO L226 Difference]: Without dead ends: 211 [2022-02-20 18:39:15,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:15,524 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 138 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:15,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 418 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-02-20 18:39:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2022-02-20 18:39:15,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:15,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 208 states, 207 states have (on average 1.5797101449275361) internal successors, (327), 207 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:15,597 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 208 states, 207 states have (on average 1.5797101449275361) internal successors, (327), 207 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:15,597 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 208 states, 207 states have (on average 1.5797101449275361) internal successors, (327), 207 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:15,611 INFO L93 Difference]: Finished difference Result 211 states and 329 transitions. [2022-02-20 18:39:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 329 transitions. [2022-02-20 18:39:15,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:15,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:15,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 207 states have (on average 1.5797101449275361) internal successors, (327), 207 states have internal predecessors, (327), 0 states have call successors, (0), 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 211 states. [2022-02-20 18:39:15,617 INFO L87 Difference]: Start difference. First operand has 208 states, 207 states have (on average 1.5797101449275361) internal successors, (327), 207 states have internal predecessors, (327), 0 states have call successors, (0), 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 211 states. [2022-02-20 18:39:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:15,624 INFO L93 Difference]: Finished difference Result 211 states and 329 transitions. [2022-02-20 18:39:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 329 transitions. [2022-02-20 18:39:15,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:15,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:15,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:15,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.5797101449275361) internal successors, (327), 207 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 327 transitions. [2022-02-20 18:39:15,633 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 327 transitions. Word has length 56 [2022-02-20 18:39:15,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:15,634 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 327 transitions. [2022-02-20 18:39:15,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 327 transitions. [2022-02-20 18:39:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:39:15,640 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:15,640 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] [2022-02-20 18:39:15,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:39:15,640 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:15,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1610685192, now seen corresponding path program 1 times [2022-02-20 18:39:15,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:15,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294842424] [2022-02-20 18:39:15,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:15,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:15,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {1279#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1790~0 := 0;~__return_1921~0 := 0; {1279#true} is VALID [2022-02-20 18:39:15,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {1279#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {1279#true} is VALID [2022-02-20 18:39:15,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {1279#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1279#true} is VALID [2022-02-20 18:39:15,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {1279#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1279#true} is VALID [2022-02-20 18:39:15,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {1279#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1279#true} is VALID [2022-02-20 18:39:15,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {1279#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1279#true} is VALID [2022-02-20 18:39:15,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {1279#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1279#true} is VALID [2022-02-20 18:39:15,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {1279#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1279#true} is VALID [2022-02-20 18:39:15,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {1279#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1279#true} is VALID [2022-02-20 18:39:15,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {1279#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1279#true} is VALID [2022-02-20 18:39:15,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {1279#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1279#true} is VALID [2022-02-20 18:39:15,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {1279#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1279#true} is VALID [2022-02-20 18:39:15,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {1279#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1279#true} is VALID [2022-02-20 18:39:15,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {1279#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1279#true} is VALID [2022-02-20 18:39:15,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {1279#true} assume ~id1~0 != ~id2~0; {1279#true} is VALID [2022-02-20 18:39:15,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {1279#true} assume ~id1~0 != ~id3~0; {1279#true} is VALID [2022-02-20 18:39:15,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {1279#true} assume ~id2~0 != ~id3~0; {1279#true} is VALID [2022-02-20 18:39:15,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {1279#true} assume ~id1~0 >= 0; {1279#true} is VALID [2022-02-20 18:39:15,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {1279#true} assume ~id2~0 >= 0; {1279#true} is VALID [2022-02-20 18:39:15,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {1279#true} assume ~id3~0 >= 0; {1279#true} is VALID [2022-02-20 18:39:15,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {1279#true} assume 0 == ~r1~0 % 256; {1279#true} is VALID [2022-02-20 18:39:15,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {1279#true} assume 0 == ~r2~0 % 256; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r122~0#1 % 256); {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r132~0#1 % 256); {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r212~0#1 % 256); {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r232~0#1 % 256); {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r312~0#1 % 256); {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r322~0#1 % 256); {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1790~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1790~0; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~mode1~0 % 256); {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 2; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~ep12~0 % 256); {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,724 INFO L290 TraceCheckUtils]: 45: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~ep13~0 % 256); {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,724 INFO L290 TraceCheckUtils]: 46: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,724 INFO L290 TraceCheckUtils]: 47: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~mode2~0 % 256); {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:39:15,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {1281#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {1280#false} is VALID [2022-02-20 18:39:15,725 INFO L290 TraceCheckUtils]: 49: Hoare triple {1280#false} ~mode2~0 := 1; {1280#false} is VALID [2022-02-20 18:39:15,725 INFO L290 TraceCheckUtils]: 50: Hoare triple {1280#false} assume !!(0 == ~mode3~0 % 256); {1280#false} is VALID [2022-02-20 18:39:15,725 INFO L290 TraceCheckUtils]: 51: Hoare triple {1280#false} assume !(~r3~0 % 256 < 2); {1280#false} is VALID [2022-02-20 18:39:15,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {1280#false} ~mode3~0 := 1; {1280#false} is VALID [2022-02-20 18:39:15,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {1280#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1280#false} is VALID [2022-02-20 18:39:15,726 INFO L290 TraceCheckUtils]: 54: Hoare triple {1280#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1280#false} is VALID [2022-02-20 18:39:15,726 INFO L290 TraceCheckUtils]: 55: Hoare triple {1280#false} ~__return_1921~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1921~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1280#false} is VALID [2022-02-20 18:39:15,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {1280#false} assume 0 == main_~assert__arg~0#1 % 256; {1280#false} is VALID [2022-02-20 18:39:15,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {1280#false} assume !false; {1280#false} is VALID [2022-02-20 18:39:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:15,727 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:15,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294842424] [2022-02-20 18:39:15,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294842424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:15,727 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:15,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:15,728 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644602069] [2022-02-20 18:39:15,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:15,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:39:15,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:15,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:15,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:15,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:15,765 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:15,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:15,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:15,766 INFO L87 Difference]: Start difference. First operand 208 states and 327 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:16,070 INFO L93 Difference]: Finished difference Result 502 states and 811 transitions. [2022-02-20 18:39:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:39:16,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:39:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:39:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:39:16,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 479 transitions. [2022-02-20 18:39:16,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:16,382 INFO L225 Difference]: With dead ends: 502 [2022-02-20 18:39:16,382 INFO L226 Difference]: Without dead ends: 348 [2022-02-20 18:39:16,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:16,383 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 118 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 391 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:39:16,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 391 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-02-20 18:39:16,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2022-02-20 18:39:16,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:16,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 344 states, 343 states have (on average 1.6005830903790088) internal successors, (549), 343 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,485 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 344 states, 343 states have (on average 1.6005830903790088) internal successors, (549), 343 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,485 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 344 states, 343 states have (on average 1.6005830903790088) internal successors, (549), 343 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:16,493 INFO L93 Difference]: Finished difference Result 348 states and 552 transitions. [2022-02-20 18:39:16,493 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 552 transitions. [2022-02-20 18:39:16,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:16,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:16,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 343 states have (on average 1.6005830903790088) internal successors, (549), 343 states have internal predecessors, (549), 0 states have call successors, (0), 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 348 states. [2022-02-20 18:39:16,495 INFO L87 Difference]: Start difference. First operand has 344 states, 343 states have (on average 1.6005830903790088) internal successors, (549), 343 states have internal predecessors, (549), 0 states have call successors, (0), 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 348 states. [2022-02-20 18:39:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:16,503 INFO L93 Difference]: Finished difference Result 348 states and 552 transitions. [2022-02-20 18:39:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 552 transitions. [2022-02-20 18:39:16,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:16,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:16,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:16,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 1.6005830903790088) internal successors, (549), 343 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 549 transitions. [2022-02-20 18:39:16,513 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 549 transitions. Word has length 58 [2022-02-20 18:39:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:16,513 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 549 transitions. [2022-02-20 18:39:16,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 549 transitions. [2022-02-20 18:39:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:39:16,514 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:16,514 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] [2022-02-20 18:39:16,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:39:16,515 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:16,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1017067947, now seen corresponding path program 1 times [2022-02-20 18:39:16,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:16,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018705414] [2022-02-20 18:39:16,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:16,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:16,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {3184#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1790~0 := 0;~__return_1921~0 := 0; {3184#true} is VALID [2022-02-20 18:39:16,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {3184#true} is VALID [2022-02-20 18:39:16,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {3184#true} is VALID [2022-02-20 18:39:16,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {3184#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {3184#true} is VALID [2022-02-20 18:39:16,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {3184#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {3184#true} is VALID [2022-02-20 18:39:16,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {3184#true} is VALID [2022-02-20 18:39:16,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {3184#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {3184#true} is VALID [2022-02-20 18:39:16,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {3184#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {3184#true} is VALID [2022-02-20 18:39:16,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {3184#true} is VALID [2022-02-20 18:39:16,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {3184#true} is VALID [2022-02-20 18:39:16,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {3184#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {3184#true} is VALID [2022-02-20 18:39:16,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {3184#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {3184#true} is VALID [2022-02-20 18:39:16,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {3184#true} is VALID [2022-02-20 18:39:16,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {3184#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {3184#true} is VALID [2022-02-20 18:39:16,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#true} assume ~id1~0 != ~id2~0; {3184#true} is VALID [2022-02-20 18:39:16,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {3184#true} assume ~id1~0 != ~id3~0; {3184#true} is VALID [2022-02-20 18:39:16,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {3184#true} assume ~id2~0 != ~id3~0; {3184#true} is VALID [2022-02-20 18:39:16,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {3184#true} assume ~id1~0 >= 0; {3184#true} is VALID [2022-02-20 18:39:16,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#true} assume ~id2~0 >= 0; {3184#true} is VALID [2022-02-20 18:39:16,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {3184#true} assume ~id3~0 >= 0; {3184#true} is VALID [2022-02-20 18:39:16,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#true} assume 0 == ~r1~0 % 256; {3184#true} is VALID [2022-02-20 18:39:16,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {3184#true} assume 0 == ~r2~0 % 256; {3184#true} is VALID [2022-02-20 18:39:16,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#true} assume 0 == ~r3~0 % 256; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r122~0#1 % 256); {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r132~0#1 % 256); {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r212~0#1 % 256); {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r232~0#1 % 256); {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r312~0#1 % 256); {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r322~0#1 % 256); {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,624 INFO L290 TraceCheckUtils]: 36: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1790~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1790~0; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,625 INFO L290 TraceCheckUtils]: 41: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,626 INFO L290 TraceCheckUtils]: 42: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode1~0 % 256); {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,626 INFO L290 TraceCheckUtils]: 43: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 2; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,626 INFO L290 TraceCheckUtils]: 44: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep12~0 % 256); {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep13~0 % 256); {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,627 INFO L290 TraceCheckUtils]: 46: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,627 INFO L290 TraceCheckUtils]: 47: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode2~0 % 256); {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,627 INFO L290 TraceCheckUtils]: 48: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep21~0 % 256); {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep23~0 % 256); {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,628 INFO L290 TraceCheckUtils]: 51: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,628 INFO L290 TraceCheckUtils]: 52: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode3~0 % 256); {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:39:16,629 INFO L290 TraceCheckUtils]: 53: Hoare triple {3186#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {3185#false} is VALID [2022-02-20 18:39:16,629 INFO L290 TraceCheckUtils]: 54: Hoare triple {3185#false} ~mode3~0 := 1; {3185#false} is VALID [2022-02-20 18:39:16,629 INFO L290 TraceCheckUtils]: 55: Hoare triple {3185#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3185#false} is VALID [2022-02-20 18:39:16,629 INFO L290 TraceCheckUtils]: 56: Hoare triple {3185#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {3185#false} is VALID [2022-02-20 18:39:16,629 INFO L290 TraceCheckUtils]: 57: Hoare triple {3185#false} ~__return_1921~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1921~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {3185#false} is VALID [2022-02-20 18:39:16,629 INFO L290 TraceCheckUtils]: 58: Hoare triple {3185#false} assume 0 == main_~assert__arg~0#1 % 256; {3185#false} is VALID [2022-02-20 18:39:16,629 INFO L290 TraceCheckUtils]: 59: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-02-20 18:39:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:16,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:16,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018705414] [2022-02-20 18:39:16,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018705414] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:16,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:16,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:16,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296266608] [2022-02-20 18:39:16,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:16,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:39:16,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:16,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:16,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:16,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:16,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:16,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:16,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:16,664 INFO L87 Difference]: Start difference. First operand 344 states and 549 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:17,087 INFO L93 Difference]: Finished difference Result 896 states and 1451 transitions. [2022-02-20 18:39:17,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:39:17,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:39:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:39:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:39:17,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 479 transitions. [2022-02-20 18:39:17,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:17,415 INFO L225 Difference]: With dead ends: 896 [2022-02-20 18:39:17,416 INFO L226 Difference]: Without dead ends: 606 [2022-02-20 18:39:17,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:17,418 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 113 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 392 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:39:17,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 392 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-02-20 18:39:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 600. [2022-02-20 18:39:17,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:17,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 606 states. Second operand has 600 states, 599 states have (on average 1.6043405676126878) internal successors, (961), 599 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:17,612 INFO L74 IsIncluded]: Start isIncluded. First operand 606 states. Second operand has 600 states, 599 states have (on average 1.6043405676126878) internal successors, (961), 599 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:17,614 INFO L87 Difference]: Start difference. First operand 606 states. Second operand has 600 states, 599 states have (on average 1.6043405676126878) internal successors, (961), 599 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:17,628 INFO L93 Difference]: Finished difference Result 606 states and 966 transitions. [2022-02-20 18:39:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 966 transitions. [2022-02-20 18:39:17,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:17,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:17,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 600 states, 599 states have (on average 1.6043405676126878) internal successors, (961), 599 states have internal predecessors, (961), 0 states have call successors, (0), 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 606 states. [2022-02-20 18:39:17,632 INFO L87 Difference]: Start difference. First operand has 600 states, 599 states have (on average 1.6043405676126878) internal successors, (961), 599 states have internal predecessors, (961), 0 states have call successors, (0), 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 606 states. [2022-02-20 18:39:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:17,646 INFO L93 Difference]: Finished difference Result 606 states and 966 transitions. [2022-02-20 18:39:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 966 transitions. [2022-02-20 18:39:17,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:17,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:17,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:17,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.6043405676126878) internal successors, (961), 599 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 961 transitions. [2022-02-20 18:39:17,664 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 961 transitions. Word has length 60 [2022-02-20 18:39:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:17,664 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 961 transitions. [2022-02-20 18:39:17,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 961 transitions. [2022-02-20 18:39:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:39:17,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:17,665 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] [2022-02-20 18:39:17,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:39:17,666 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:17,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash 291448600, now seen corresponding path program 1 times [2022-02-20 18:39:17,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:17,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454825528] [2022-02-20 18:39:17,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:17,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:17,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {6561#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1790~0 := 0;~__return_1921~0 := 0; {6561#true} is VALID [2022-02-20 18:39:17,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {6561#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {6561#true} is VALID [2022-02-20 18:39:17,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {6561#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {6561#true} is VALID [2022-02-20 18:39:17,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {6561#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {6561#true} is VALID [2022-02-20 18:39:17,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {6561#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {6561#true} is VALID [2022-02-20 18:39:17,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {6561#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {6561#true} is VALID [2022-02-20 18:39:17,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {6561#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {6561#true} is VALID [2022-02-20 18:39:17,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {6561#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {6561#true} is VALID [2022-02-20 18:39:17,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {6561#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {6561#true} is VALID [2022-02-20 18:39:17,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {6561#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {6561#true} is VALID [2022-02-20 18:39:17,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {6561#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {6561#true} is VALID [2022-02-20 18:39:17,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {6561#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {6561#true} is VALID [2022-02-20 18:39:17,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {6561#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {6561#true} is VALID [2022-02-20 18:39:17,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {6561#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {6561#true} is VALID [2022-02-20 18:39:17,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {6561#true} assume ~id1~0 != ~id2~0; {6561#true} is VALID [2022-02-20 18:39:17,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {6561#true} assume ~id1~0 != ~id3~0; {6561#true} is VALID [2022-02-20 18:39:17,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {6561#true} assume ~id2~0 != ~id3~0; {6561#true} is VALID [2022-02-20 18:39:17,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {6561#true} assume ~id1~0 >= 0; {6561#true} is VALID [2022-02-20 18:39:17,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {6561#true} assume ~id2~0 >= 0; {6561#true} is VALID [2022-02-20 18:39:17,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {6561#true} assume ~id3~0 >= 0; {6561#true} is VALID [2022-02-20 18:39:17,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {6561#true} assume 0 == ~r1~0 % 256; {6561#true} is VALID [2022-02-20 18:39:17,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {6561#true} assume 0 == ~r2~0 % 256; {6561#true} is VALID [2022-02-20 18:39:17,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {6561#true} assume 0 == ~r3~0 % 256; {6561#true} is VALID [2022-02-20 18:39:17,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {6561#true} assume !(0 == main_~init__r122~0#1 % 256); {6561#true} is VALID [2022-02-20 18:39:17,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {6561#true} assume !(0 == main_~init__r132~0#1 % 256); {6561#true} is VALID [2022-02-20 18:39:17,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {6561#true} assume !(0 == main_~init__r212~0#1 % 256); {6561#true} is VALID [2022-02-20 18:39:17,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {6561#true} assume !(0 == main_~init__r232~0#1 % 256); {6561#true} is VALID [2022-02-20 18:39:17,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {6561#true} assume !(0 == main_~init__r312~0#1 % 256); {6561#true} is VALID [2022-02-20 18:39:17,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {6561#true} assume !(0 == main_~init__r322~0#1 % 256); {6561#true} is VALID [2022-02-20 18:39:17,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {6561#true} assume ~max1~0 == ~id1~0; {6561#true} is VALID [2022-02-20 18:39:17,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {6561#true} assume ~max2~0 == ~id2~0; {6561#true} is VALID [2022-02-20 18:39:17,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {6561#true} assume ~max3~0 == ~id3~0; {6561#true} is VALID [2022-02-20 18:39:17,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {6561#true} assume 0 == ~st1~0; {6563#(<= ~st1~0 0)} is VALID [2022-02-20 18:39:17,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {6563#(<= ~st1~0 0)} assume 0 == ~st2~0; {6564#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {6564#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1790~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1790~0; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,741 INFO L290 TraceCheckUtils]: 55: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,742 INFO L290 TraceCheckUtils]: 56: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,742 INFO L290 TraceCheckUtils]: 57: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:17,742 INFO L290 TraceCheckUtils]: 58: Hoare triple {6565#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {6562#false} is VALID [2022-02-20 18:39:17,742 INFO L290 TraceCheckUtils]: 59: Hoare triple {6562#false} ~__return_1921~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1921~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {6562#false} is VALID [2022-02-20 18:39:17,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {6562#false} assume 0 == main_~assert__arg~0#1 % 256; {6562#false} is VALID [2022-02-20 18:39:17,743 INFO L290 TraceCheckUtils]: 61: Hoare triple {6562#false} assume !false; {6562#false} is VALID [2022-02-20 18:39:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:17,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:17,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454825528] [2022-02-20 18:39:17,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454825528] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:17,744 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:17,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:39:17,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784668038] [2022-02-20 18:39:17,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:17,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:39:17,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:17,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:17,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:17,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:39:17,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:17,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:39:17,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:17,778 INFO L87 Difference]: Start difference. First operand 600 states and 961 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:19,976 INFO L93 Difference]: Finished difference Result 2588 states and 4247 transitions. [2022-02-20 18:39:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:39:19,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:39:19,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:19,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1052 transitions. [2022-02-20 18:39:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1052 transitions. [2022-02-20 18:39:19,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1052 transitions. [2022-02-20 18:39:20,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1052 edges. 1052 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:20,781 INFO L225 Difference]: With dead ends: 2588 [2022-02-20 18:39:20,781 INFO L226 Difference]: Without dead ends: 2042 [2022-02-20 18:39:20,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:39:20,783 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 851 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:20,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [851 Valid, 1318 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:39:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2022-02-20 18:39:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1077. [2022-02-20 18:39:21,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:21,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2042 states. Second operand has 1077 states, 1076 states have (on average 1.6161710037174721) internal successors, (1739), 1076 states have internal predecessors, (1739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:21,536 INFO L74 IsIncluded]: Start isIncluded. First operand 2042 states. Second operand has 1077 states, 1076 states have (on average 1.6161710037174721) internal successors, (1739), 1076 states have internal predecessors, (1739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:21,537 INFO L87 Difference]: Start difference. First operand 2042 states. Second operand has 1077 states, 1076 states have (on average 1.6161710037174721) internal successors, (1739), 1076 states have internal predecessors, (1739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:21,651 INFO L93 Difference]: Finished difference Result 2042 states and 3332 transitions. [2022-02-20 18:39:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 3332 transitions. [2022-02-20 18:39:21,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:21,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:21,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 1077 states, 1076 states have (on average 1.6161710037174721) internal successors, (1739), 1076 states have internal predecessors, (1739), 0 states have call successors, (0), 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 2042 states. [2022-02-20 18:39:21,657 INFO L87 Difference]: Start difference. First operand has 1077 states, 1076 states have (on average 1.6161710037174721) internal successors, (1739), 1076 states have internal predecessors, (1739), 0 states have call successors, (0), 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 2042 states. [2022-02-20 18:39:21,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:21,763 INFO L93 Difference]: Finished difference Result 2042 states and 3332 transitions. [2022-02-20 18:39:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 3332 transitions. [2022-02-20 18:39:21,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:21,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:21,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:21,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.6161710037174721) internal successors, (1739), 1076 states have internal predecessors, (1739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1739 transitions. [2022-02-20 18:39:21,811 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1739 transitions. Word has length 62 [2022-02-20 18:39:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:21,811 INFO L470 AbstractCegarLoop]: Abstraction has 1077 states and 1739 transitions. [2022-02-20 18:39:21,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1739 transitions. [2022-02-20 18:39:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:39:21,812 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:21,812 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:39:21,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:39:21,813 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash 382467820, now seen corresponding path program 1 times [2022-02-20 18:39:21,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:21,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412899795] [2022-02-20 18:39:21,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:21,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:21,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {15993#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1790~0 := 0;~__return_1921~0 := 0; {15993#true} is VALID [2022-02-20 18:39:21,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {15993#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {15993#true} is VALID [2022-02-20 18:39:21,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {15993#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {15993#true} is VALID [2022-02-20 18:39:21,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {15993#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {15993#true} is VALID [2022-02-20 18:39:21,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {15993#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {15993#true} is VALID [2022-02-20 18:39:21,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {15993#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {15993#true} is VALID [2022-02-20 18:39:21,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {15993#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {15993#true} is VALID [2022-02-20 18:39:21,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {15993#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {15993#true} is VALID [2022-02-20 18:39:21,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {15993#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {15993#true} is VALID [2022-02-20 18:39:21,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {15993#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {15993#true} is VALID [2022-02-20 18:39:21,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {15993#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {15993#true} is VALID [2022-02-20 18:39:21,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {15993#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {15993#true} is VALID [2022-02-20 18:39:21,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {15993#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {15993#true} is VALID [2022-02-20 18:39:21,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {15993#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {15993#true} is VALID [2022-02-20 18:39:21,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {15993#true} assume ~id1~0 != ~id2~0; {15993#true} is VALID [2022-02-20 18:39:21,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {15993#true} assume ~id1~0 != ~id3~0; {15993#true} is VALID [2022-02-20 18:39:21,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {15993#true} assume ~id2~0 != ~id3~0; {15993#true} is VALID [2022-02-20 18:39:21,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {15993#true} assume ~id1~0 >= 0; {15993#true} is VALID [2022-02-20 18:39:21,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {15993#true} assume ~id2~0 >= 0; {15993#true} is VALID [2022-02-20 18:39:21,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {15993#true} assume ~id3~0 >= 0; {15993#true} is VALID [2022-02-20 18:39:21,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {15993#true} assume 0 == ~r1~0 % 256; {15993#true} is VALID [2022-02-20 18:39:21,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {15993#true} assume 0 == ~r2~0 % 256; {15993#true} is VALID [2022-02-20 18:39:21,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {15993#true} assume 0 == ~r3~0 % 256; {15993#true} is VALID [2022-02-20 18:39:21,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {15993#true} assume !(0 == main_~init__r122~0#1 % 256); {15993#true} is VALID [2022-02-20 18:39:21,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {15993#true} assume !(0 == main_~init__r132~0#1 % 256); {15993#true} is VALID [2022-02-20 18:39:21,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {15993#true} assume !(0 == main_~init__r212~0#1 % 256); {15993#true} is VALID [2022-02-20 18:39:21,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {15993#true} assume !(0 == main_~init__r232~0#1 % 256); {15993#true} is VALID [2022-02-20 18:39:21,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {15993#true} assume !(0 == main_~init__r312~0#1 % 256); {15993#true} is VALID [2022-02-20 18:39:21,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {15993#true} assume !(0 == main_~init__r322~0#1 % 256); {15993#true} is VALID [2022-02-20 18:39:21,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {15993#true} assume ~max1~0 == ~id1~0; {15993#true} is VALID [2022-02-20 18:39:21,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {15993#true} assume ~max2~0 == ~id2~0; {15993#true} is VALID [2022-02-20 18:39:21,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {15993#true} assume ~max3~0 == ~id3~0; {15993#true} is VALID [2022-02-20 18:39:21,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {15993#true} assume 0 == ~st1~0; {15995#(<= ~st1~0 0)} is VALID [2022-02-20 18:39:21,863 INFO L290 TraceCheckUtils]: 33: Hoare triple {15995#(<= ~st1~0 0)} assume 0 == ~st2~0; {15995#(<= ~st1~0 0)} is VALID [2022-02-20 18:39:21,863 INFO L290 TraceCheckUtils]: 34: Hoare triple {15995#(<= ~st1~0 0)} assume 0 == ~st3~0; {15995#(<= ~st1~0 0)} is VALID [2022-02-20 18:39:21,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {15995#(<= ~st1~0 0)} assume 0 == ~nl1~0; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,865 INFO L290 TraceCheckUtils]: 38: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,865 INFO L290 TraceCheckUtils]: 39: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,865 INFO L290 TraceCheckUtils]: 40: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1790~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1790~0; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,866 INFO L290 TraceCheckUtils]: 42: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,866 INFO L290 TraceCheckUtils]: 43: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,867 INFO L290 TraceCheckUtils]: 47: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,867 INFO L290 TraceCheckUtils]: 49: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,868 INFO L290 TraceCheckUtils]: 50: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,868 INFO L290 TraceCheckUtils]: 51: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,868 INFO L290 TraceCheckUtils]: 52: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,869 INFO L290 TraceCheckUtils]: 55: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,869 INFO L290 TraceCheckUtils]: 56: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,870 INFO L290 TraceCheckUtils]: 57: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,870 INFO L290 TraceCheckUtils]: 58: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15996#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:39:21,870 INFO L290 TraceCheckUtils]: 59: Hoare triple {15996#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);main_~check__tmp~0#1 := 0; {15994#false} is VALID [2022-02-20 18:39:21,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {15994#false} ~__return_1921~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1921~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {15994#false} is VALID [2022-02-20 18:39:21,871 INFO L290 TraceCheckUtils]: 61: Hoare triple {15994#false} assume 0 == main_~assert__arg~0#1 % 256; {15994#false} is VALID [2022-02-20 18:39:21,871 INFO L290 TraceCheckUtils]: 62: Hoare triple {15994#false} assume !false; {15994#false} is VALID [2022-02-20 18:39:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:21,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:21,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412899795] [2022-02-20 18:39:21,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412899795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:21,872 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:21,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:39:21,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724157996] [2022-02-20 18:39:21,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:21,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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:39:21,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:21,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:21,908 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:39:21,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:39:21,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:21,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:39:21,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:39:21,909 INFO L87 Difference]: Start difference. First operand 1077 states and 1739 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:24,268 INFO L93 Difference]: Finished difference Result 3142 states and 5146 transitions. [2022-02-20 18:39:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:24,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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:39:24,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2022-02-20 18:39:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2022-02-20 18:39:24,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 632 transitions. [2022-02-20 18:39:24,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 632 edges. 632 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:24,822 INFO L225 Difference]: With dead ends: 3142 [2022-02-20 18:39:24,822 INFO L226 Difference]: Without dead ends: 2119 [2022-02-20 18:39:24,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:24,824 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 404 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:24,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 624 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-02-20 18:39:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1589. [2022-02-20 18:39:25,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:25,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2119 states. Second operand has 1589 states, 1588 states have (on average 1.6246851385390428) internal successors, (2580), 1588 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:25,997 INFO L74 IsIncluded]: Start isIncluded. First operand 2119 states. Second operand has 1589 states, 1588 states have (on average 1.6246851385390428) internal successors, (2580), 1588 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:25,999 INFO L87 Difference]: Start difference. First operand 2119 states. Second operand has 1589 states, 1588 states have (on average 1.6246851385390428) internal successors, (2580), 1588 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:26,111 INFO L93 Difference]: Finished difference Result 2119 states and 3465 transitions. [2022-02-20 18:39:26,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3465 transitions. [2022-02-20 18:39:26,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:26,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:26,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 1589 states, 1588 states have (on average 1.6246851385390428) internal successors, (2580), 1588 states have internal predecessors, (2580), 0 states have call successors, (0), 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 2119 states. [2022-02-20 18:39:26,120 INFO L87 Difference]: Start difference. First operand has 1589 states, 1588 states have (on average 1.6246851385390428) internal successors, (2580), 1588 states have internal predecessors, (2580), 0 states have call successors, (0), 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 2119 states. [2022-02-20 18:39:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:26,233 INFO L93 Difference]: Finished difference Result 2119 states and 3465 transitions. [2022-02-20 18:39:26,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3465 transitions. [2022-02-20 18:39:26,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:26,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:26,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:26,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 1.6246851385390428) internal successors, (2580), 1588 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2580 transitions. [2022-02-20 18:39:26,333 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2580 transitions. Word has length 63 [2022-02-20 18:39:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:26,334 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 2580 transitions. [2022-02-20 18:39:26,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2580 transitions. [2022-02-20 18:39:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:39:26,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:26,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:26,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:39:26,335 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:26,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1086345633, now seen corresponding path program 1 times [2022-02-20 18:39:26,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:26,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066865706] [2022-02-20 18:39:26,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:26,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:26,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {27140#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1790~0 := 0;~__return_1921~0 := 0; {27140#true} is VALID [2022-02-20 18:39:26,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {27140#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {27140#true} is VALID [2022-02-20 18:39:26,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {27140#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {27140#true} is VALID [2022-02-20 18:39:26,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {27140#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {27140#true} is VALID [2022-02-20 18:39:26,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {27140#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {27140#true} is VALID [2022-02-20 18:39:26,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {27140#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {27140#true} is VALID [2022-02-20 18:39:26,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {27140#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {27140#true} is VALID [2022-02-20 18:39:26,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {27140#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {27140#true} is VALID [2022-02-20 18:39:26,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {27140#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {27140#true} is VALID [2022-02-20 18:39:26,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {27140#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {27140#true} is VALID [2022-02-20 18:39:26,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {27140#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {27140#true} is VALID [2022-02-20 18:39:26,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {27140#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {27140#true} is VALID [2022-02-20 18:39:26,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {27140#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {27140#true} is VALID [2022-02-20 18:39:26,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {27140#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {27140#true} is VALID [2022-02-20 18:39:26,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {27140#true} assume ~id1~0 != ~id2~0; {27140#true} is VALID [2022-02-20 18:39:26,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {27140#true} assume ~id1~0 != ~id3~0; {27140#true} is VALID [2022-02-20 18:39:26,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {27140#true} assume ~id2~0 != ~id3~0; {27140#true} is VALID [2022-02-20 18:39:26,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {27140#true} assume ~id1~0 >= 0; {27140#true} is VALID [2022-02-20 18:39:26,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {27140#true} assume ~id2~0 >= 0; {27140#true} is VALID [2022-02-20 18:39:26,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {27140#true} assume ~id3~0 >= 0; {27140#true} is VALID [2022-02-20 18:39:26,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {27140#true} assume 0 == ~r1~0 % 256; {27140#true} is VALID [2022-02-20 18:39:26,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {27140#true} assume 0 == ~r2~0 % 256; {27140#true} is VALID [2022-02-20 18:39:26,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {27140#true} assume 0 == ~r3~0 % 256; {27140#true} is VALID [2022-02-20 18:39:26,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {27140#true} assume !(0 == main_~init__r122~0#1 % 256); {27140#true} is VALID [2022-02-20 18:39:26,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {27140#true} assume !(0 == main_~init__r132~0#1 % 256); {27140#true} is VALID [2022-02-20 18:39:26,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {27140#true} assume !(0 == main_~init__r212~0#1 % 256); {27140#true} is VALID [2022-02-20 18:39:26,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {27140#true} assume !(0 == main_~init__r232~0#1 % 256); {27140#true} is VALID [2022-02-20 18:39:26,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {27140#true} assume !(0 == main_~init__r312~0#1 % 256); {27140#true} is VALID [2022-02-20 18:39:26,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {27140#true} assume !(0 == main_~init__r322~0#1 % 256); {27140#true} is VALID [2022-02-20 18:39:26,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {27140#true} assume ~max1~0 == ~id1~0; {27140#true} is VALID [2022-02-20 18:39:26,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {27140#true} assume ~max2~0 == ~id2~0; {27140#true} is VALID [2022-02-20 18:39:26,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {27140#true} assume ~max3~0 == ~id3~0; {27140#true} is VALID [2022-02-20 18:39:26,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {27140#true} assume 0 == ~st1~0; {27140#true} is VALID [2022-02-20 18:39:26,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {27140#true} assume 0 == ~st2~0; {27142#(<= ~st2~0 0)} is VALID [2022-02-20 18:39:26,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {27142#(<= ~st2~0 0)} assume 0 == ~st3~0; {27142#(<= ~st2~0 0)} is VALID [2022-02-20 18:39:26,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {27142#(<= ~st2~0 0)} assume 0 == ~nl1~0; {27142#(<= ~st2~0 0)} is VALID [2022-02-20 18:39:26,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {27142#(<= ~st2~0 0)} assume 0 == ~nl2~0; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1790~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1790~0; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 2; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep12~0 % 256); {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep13~0 % 256); {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,397 INFO L290 TraceCheckUtils]: 49: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep21~0 % 256); {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep23~0 % 256); {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,397 INFO L290 TraceCheckUtils]: 51: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,398 INFO L290 TraceCheckUtils]: 53: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep31~0 % 256); {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep32~0 % 256); {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,399 INFO L290 TraceCheckUtils]: 56: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,399 INFO L290 TraceCheckUtils]: 57: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,400 INFO L290 TraceCheckUtils]: 58: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,400 INFO L290 TraceCheckUtils]: 59: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {27143#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:39:26,400 INFO L290 TraceCheckUtils]: 60: Hoare triple {27143#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);main_~check__tmp~0#1 := 0; {27141#false} is VALID [2022-02-20 18:39:26,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {27141#false} ~__return_1921~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1921~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {27141#false} is VALID [2022-02-20 18:39:26,401 INFO L290 TraceCheckUtils]: 62: Hoare triple {27141#false} assume 0 == main_~assert__arg~0#1 % 256; {27141#false} is VALID [2022-02-20 18:39:26,401 INFO L290 TraceCheckUtils]: 63: Hoare triple {27141#false} assume !false; {27141#false} is VALID [2022-02-20 18:39:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:26,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:26,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066865706] [2022-02-20 18:39:26,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066865706] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:26,402 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:26,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:39:26,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570441162] [2022-02-20 18:39:26,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:26,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:39:26,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:26,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:26,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:26,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:39:26,441 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:26,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:39:26,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:39:26,442 INFO L87 Difference]: Start difference. First operand 1589 states and 2580 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:30,434 INFO L93 Difference]: Finished difference Result 4610 states and 7544 transitions. [2022-02-20 18:39:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:30,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:39:30,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2022-02-20 18:39:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2022-02-20 18:39:30,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 632 transitions. [2022-02-20 18:39:30,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 632 edges. 632 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:31,214 INFO L225 Difference]: With dead ends: 4610 [2022-02-20 18:39:31,214 INFO L226 Difference]: Without dead ends: 3075 [2022-02-20 18:39:31,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:31,217 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 402 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:31,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 717 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:31,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2022-02-20 18:39:33,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2320. [2022-02-20 18:39:33,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:33,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3075 states. Second operand has 2320 states, 2319 states have (on average 1.624407072013799) internal successors, (3767), 2319 states have internal predecessors, (3767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:33,507 INFO L74 IsIncluded]: Start isIncluded. First operand 3075 states. Second operand has 2320 states, 2319 states have (on average 1.624407072013799) internal successors, (3767), 2319 states have internal predecessors, (3767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:33,512 INFO L87 Difference]: Start difference. First operand 3075 states. Second operand has 2320 states, 2319 states have (on average 1.624407072013799) internal successors, (3767), 2319 states have internal predecessors, (3767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:33,760 INFO L93 Difference]: Finished difference Result 3075 states and 5016 transitions. [2022-02-20 18:39:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3075 states and 5016 transitions. [2022-02-20 18:39:33,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:33,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:33,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 2320 states, 2319 states have (on average 1.624407072013799) internal successors, (3767), 2319 states have internal predecessors, (3767), 0 states have call successors, (0), 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 3075 states. [2022-02-20 18:39:33,769 INFO L87 Difference]: Start difference. First operand has 2320 states, 2319 states have (on average 1.624407072013799) internal successors, (3767), 2319 states have internal predecessors, (3767), 0 states have call successors, (0), 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 3075 states. [2022-02-20 18:39:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:34,019 INFO L93 Difference]: Finished difference Result 3075 states and 5016 transitions. [2022-02-20 18:39:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3075 states and 5016 transitions. [2022-02-20 18:39:34,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:34,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:34,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:34,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2320 states, 2319 states have (on average 1.624407072013799) internal successors, (3767), 2319 states have internal predecessors, (3767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3767 transitions. [2022-02-20 18:39:34,229 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3767 transitions. Word has length 64 [2022-02-20 18:39:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:34,230 INFO L470 AbstractCegarLoop]: Abstraction has 2320 states and 3767 transitions. [2022-02-20 18:39:34,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3767 transitions. [2022-02-20 18:39:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:39:34,231 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:34,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:34,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:39:34,231 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:34,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:34,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1879078355, now seen corresponding path program 1 times [2022-02-20 18:39:34,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:34,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896346321] [2022-02-20 18:39:34,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:34,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:34,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {43445#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1790~0 := 0;~__return_1921~0 := 0; {43445#true} is VALID [2022-02-20 18:39:34,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {43445#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {43445#true} is VALID [2022-02-20 18:39:34,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {43445#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {43445#true} is VALID [2022-02-20 18:39:34,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {43445#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {43445#true} is VALID [2022-02-20 18:39:34,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {43445#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {43445#true} is VALID [2022-02-20 18:39:34,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {43445#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {43445#true} is VALID [2022-02-20 18:39:34,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {43445#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {43445#true} is VALID [2022-02-20 18:39:34,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {43445#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {43445#true} is VALID [2022-02-20 18:39:34,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {43445#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {43445#true} is VALID [2022-02-20 18:39:34,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {43445#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {43445#true} is VALID [2022-02-20 18:39:34,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {43445#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {43445#true} is VALID [2022-02-20 18:39:34,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {43445#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {43445#true} is VALID [2022-02-20 18:39:34,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {43445#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {43445#true} is VALID [2022-02-20 18:39:34,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {43445#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {43445#true} is VALID [2022-02-20 18:39:34,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {43445#true} assume ~id1~0 != ~id2~0; {43445#true} is VALID [2022-02-20 18:39:34,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {43445#true} assume ~id1~0 != ~id3~0; {43445#true} is VALID [2022-02-20 18:39:34,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {43445#true} assume ~id2~0 != ~id3~0; {43445#true} is VALID [2022-02-20 18:39:34,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {43445#true} assume ~id1~0 >= 0; {43445#true} is VALID [2022-02-20 18:39:34,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {43445#true} assume ~id2~0 >= 0; {43445#true} is VALID [2022-02-20 18:39:34,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {43445#true} assume ~id3~0 >= 0; {43445#true} is VALID [2022-02-20 18:39:34,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {43445#true} assume 0 == ~r1~0 % 256; {43445#true} is VALID [2022-02-20 18:39:34,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {43445#true} assume 0 == ~r2~0 % 256; {43445#true} is VALID [2022-02-20 18:39:34,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {43445#true} assume 0 == ~r3~0 % 256; {43445#true} is VALID [2022-02-20 18:39:34,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {43445#true} assume !(0 == main_~init__r122~0#1 % 256); {43445#true} is VALID [2022-02-20 18:39:34,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {43445#true} assume !(0 == main_~init__r132~0#1 % 256); {43445#true} is VALID [2022-02-20 18:39:34,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {43445#true} assume !(0 == main_~init__r212~0#1 % 256); {43445#true} is VALID [2022-02-20 18:39:34,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {43445#true} assume !(0 == main_~init__r232~0#1 % 256); {43445#true} is VALID [2022-02-20 18:39:34,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {43445#true} assume !(0 == main_~init__r312~0#1 % 256); {43445#true} is VALID [2022-02-20 18:39:34,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {43445#true} assume !(0 == main_~init__r322~0#1 % 256); {43445#true} is VALID [2022-02-20 18:39:34,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {43445#true} assume ~max1~0 == ~id1~0; {43445#true} is VALID [2022-02-20 18:39:34,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {43445#true} assume ~max2~0 == ~id2~0; {43445#true} is VALID [2022-02-20 18:39:34,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {43445#true} assume ~max3~0 == ~id3~0; {43445#true} is VALID [2022-02-20 18:39:34,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {43445#true} assume 0 == ~st1~0; {43445#true} is VALID [2022-02-20 18:39:34,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {43445#true} assume 0 == ~st2~0; {43445#true} is VALID [2022-02-20 18:39:34,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {43445#true} assume 0 == ~st3~0; {43445#true} is VALID [2022-02-20 18:39:34,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {43445#true} assume 0 == ~nl1~0; {43445#true} is VALID [2022-02-20 18:39:34,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {43445#true} assume 0 == ~nl2~0; {43445#true} is VALID [2022-02-20 18:39:34,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {43445#true} assume 0 == ~nl3~0; {43445#true} is VALID [2022-02-20 18:39:34,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {43445#true} assume 0 == ~mode1~0 % 256; {43445#true} is VALID [2022-02-20 18:39:34,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {43445#true} assume 0 == ~mode2~0 % 256; {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:34,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1790~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1790~0; {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:34,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:34,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:34,309 INFO L290 TraceCheckUtils]: 43: Hoare triple {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 2; {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:34,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep12~0 % 256); {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:34,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep13~0 % 256); {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:34,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:39:34,311 INFO L290 TraceCheckUtils]: 47: Hoare triple {43447#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256); {43446#false} is VALID [2022-02-20 18:39:34,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {43446#false} assume !(255 == ~r2~0 % 256); {43446#false} is VALID [2022-02-20 18:39:34,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {43446#false} ~r2~0 := 1 + ~r2~0 % 256; {43446#false} is VALID [2022-02-20 18:39:34,312 INFO L290 TraceCheckUtils]: 50: Hoare triple {43446#false} assume !!(0 == ~ep12~0 % 256); {43446#false} is VALID [2022-02-20 18:39:34,312 INFO L290 TraceCheckUtils]: 51: Hoare triple {43446#false} assume !!(0 == ~ep32~0 % 256); {43446#false} is VALID [2022-02-20 18:39:34,312 INFO L290 TraceCheckUtils]: 52: Hoare triple {43446#false} assume 2 == ~r2~0 % 256; {43446#false} is VALID [2022-02-20 18:39:34,312 INFO L290 TraceCheckUtils]: 53: Hoare triple {43446#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {43446#false} is VALID [2022-02-20 18:39:34,312 INFO L290 TraceCheckUtils]: 54: Hoare triple {43446#false} ~mode2~0 := 0; {43446#false} is VALID [2022-02-20 18:39:34,312 INFO L290 TraceCheckUtils]: 55: Hoare triple {43446#false} assume !!(0 == ~mode3~0 % 256); {43446#false} is VALID [2022-02-20 18:39:34,312 INFO L290 TraceCheckUtils]: 56: Hoare triple {43446#false} assume ~r3~0 % 256 < 2; {43446#false} is VALID [2022-02-20 18:39:34,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {43446#false} assume !!(0 == ~ep31~0 % 256); {43446#false} is VALID [2022-02-20 18:39:34,313 INFO L290 TraceCheckUtils]: 58: Hoare triple {43446#false} assume !!(0 == ~ep32~0 % 256); {43446#false} is VALID [2022-02-20 18:39:34,313 INFO L290 TraceCheckUtils]: 59: Hoare triple {43446#false} ~mode3~0 := 1; {43446#false} is VALID [2022-02-20 18:39:34,313 INFO L290 TraceCheckUtils]: 60: Hoare triple {43446#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {43446#false} is VALID [2022-02-20 18:39:34,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {43446#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {43446#false} is VALID [2022-02-20 18:39:34,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {43446#false} ~__return_1921~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1921~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {43446#false} is VALID [2022-02-20 18:39:34,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {43446#false} assume 0 == main_~assert__arg~0#1 % 256; {43446#false} is VALID [2022-02-20 18:39:34,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {43446#false} assume !false; {43446#false} is VALID [2022-02-20 18:39:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:34,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:34,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896346321] [2022-02-20 18:39:34,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896346321] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:34,327 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:34,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:34,327 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635994792] [2022-02-20 18:39:34,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:34,328 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:39:34,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:34,329 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:39:34,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:34,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:34,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:34,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:34,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:34,360 INFO L87 Difference]: Start difference. First operand 2320 states and 3767 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:39:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:38,772 INFO L93 Difference]: Finished difference Result 5110 states and 8342 transitions. [2022-02-20 18:39:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:39:38,772 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:39:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:38,772 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:39:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2022-02-20 18:39:38,773 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:39:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2022-02-20 18:39:38,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 457 transitions. [2022-02-20 18:39:39,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:39,528 INFO L225 Difference]: With dead ends: 5110 [2022-02-20 18:39:39,528 INFO L226 Difference]: Without dead ends: 3501 [2022-02-20 18:39:39,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:39,530 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 117 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:39,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 463 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2022-02-20 18:39:42,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3499. [2022-02-20 18:39:42,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:42,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3501 states. Second operand has 3499 states, 3498 states have (on average 1.6217838765008576) internal successors, (5673), 3498 states have internal predecessors, (5673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:42,891 INFO L74 IsIncluded]: Start isIncluded. First operand 3501 states. Second operand has 3499 states, 3498 states have (on average 1.6217838765008576) internal successors, (5673), 3498 states have internal predecessors, (5673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:42,895 INFO L87 Difference]: Start difference. First operand 3501 states. Second operand has 3499 states, 3498 states have (on average 1.6217838765008576) internal successors, (5673), 3498 states have internal predecessors, (5673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:43,211 INFO L93 Difference]: Finished difference Result 3501 states and 5674 transitions. [2022-02-20 18:39:43,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 5674 transitions. [2022-02-20 18:39:43,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:43,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:43,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 3499 states, 3498 states have (on average 1.6217838765008576) internal successors, (5673), 3498 states have internal predecessors, (5673), 0 states have call successors, (0), 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 3501 states. [2022-02-20 18:39:43,224 INFO L87 Difference]: Start difference. First operand has 3499 states, 3498 states have (on average 1.6217838765008576) internal successors, (5673), 3498 states have internal predecessors, (5673), 0 states have call successors, (0), 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 3501 states. [2022-02-20 18:39:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:43,544 INFO L93 Difference]: Finished difference Result 3501 states and 5674 transitions. [2022-02-20 18:39:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 5674 transitions. [2022-02-20 18:39:43,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:43,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:43,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:43,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 3498 states have (on average 1.6217838765008576) internal successors, (5673), 3498 states have internal predecessors, (5673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 5673 transitions. [2022-02-20 18:39:44,053 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 5673 transitions. Word has length 65 [2022-02-20 18:39:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:44,053 INFO L470 AbstractCegarLoop]: Abstraction has 3499 states and 5673 transitions. [2022-02-20 18:39:44,053 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:39:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 5673 transitions. [2022-02-20 18:39:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:39:44,054 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:44,054 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:44,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:39:44,054 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash -450865020, now seen corresponding path program 1 times [2022-02-20 18:39:44,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:44,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69897785] [2022-02-20 18:39:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:44,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:44,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {63080#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1790~0 := 0;~__return_1921~0 := 0; {63080#true} is VALID [2022-02-20 18:39:44,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {63080#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {63080#true} is VALID [2022-02-20 18:39:44,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {63080#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {63080#true} is VALID [2022-02-20 18:39:44,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {63080#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {63080#true} is VALID [2022-02-20 18:39:44,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {63080#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {63080#true} is VALID [2022-02-20 18:39:44,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {63080#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {63080#true} is VALID [2022-02-20 18:39:44,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {63080#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {63080#true} is VALID [2022-02-20 18:39:44,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {63080#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {63080#true} is VALID [2022-02-20 18:39:44,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {63080#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {63080#true} is VALID [2022-02-20 18:39:44,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {63080#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {63080#true} is VALID [2022-02-20 18:39:44,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {63080#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {63080#true} is VALID [2022-02-20 18:39:44,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {63080#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {63080#true} is VALID [2022-02-20 18:39:44,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {63080#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {63080#true} is VALID [2022-02-20 18:39:44,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {63080#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {63080#true} is VALID [2022-02-20 18:39:44,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {63080#true} assume ~id1~0 != ~id2~0; {63080#true} is VALID [2022-02-20 18:39:44,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {63080#true} assume ~id1~0 != ~id3~0; {63080#true} is VALID [2022-02-20 18:39:44,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {63080#true} assume ~id2~0 != ~id3~0; {63080#true} is VALID [2022-02-20 18:39:44,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {63080#true} assume ~id1~0 >= 0; {63080#true} is VALID [2022-02-20 18:39:44,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {63080#true} assume ~id2~0 >= 0; {63080#true} is VALID [2022-02-20 18:39:44,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {63080#true} assume ~id3~0 >= 0; {63080#true} is VALID [2022-02-20 18:39:44,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {63080#true} assume 0 == ~r1~0 % 256; {63080#true} is VALID [2022-02-20 18:39:44,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {63080#true} assume 0 == ~r2~0 % 256; {63080#true} is VALID [2022-02-20 18:39:44,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {63080#true} assume 0 == ~r3~0 % 256; {63080#true} is VALID [2022-02-20 18:39:44,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {63080#true} assume !(0 == main_~init__r122~0#1 % 256); {63080#true} is VALID [2022-02-20 18:39:44,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {63080#true} assume !(0 == main_~init__r132~0#1 % 256); {63080#true} is VALID [2022-02-20 18:39:44,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {63080#true} assume !(0 == main_~init__r212~0#1 % 256); {63080#true} is VALID [2022-02-20 18:39:44,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {63080#true} assume !(0 == main_~init__r232~0#1 % 256); {63080#true} is VALID [2022-02-20 18:39:44,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {63080#true} assume !(0 == main_~init__r312~0#1 % 256); {63080#true} is VALID [2022-02-20 18:39:44,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {63080#true} assume !(0 == main_~init__r322~0#1 % 256); {63080#true} is VALID [2022-02-20 18:39:44,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {63080#true} assume ~max1~0 == ~id1~0; {63080#true} is VALID [2022-02-20 18:39:44,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {63080#true} assume ~max2~0 == ~id2~0; {63080#true} is VALID [2022-02-20 18:39:44,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {63080#true} assume ~max3~0 == ~id3~0; {63080#true} is VALID [2022-02-20 18:39:44,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {63080#true} assume 0 == ~st1~0; {63080#true} is VALID [2022-02-20 18:39:44,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {63080#true} assume 0 == ~st2~0; {63080#true} is VALID [2022-02-20 18:39:44,090 INFO L290 TraceCheckUtils]: 34: Hoare triple {63080#true} assume 0 == ~st3~0; {63080#true} is VALID [2022-02-20 18:39:44,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {63080#true} assume 0 == ~nl1~0; {63080#true} is VALID [2022-02-20 18:39:44,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {63080#true} assume 0 == ~nl2~0; {63080#true} is VALID [2022-02-20 18:39:44,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {63080#true} assume 0 == ~nl3~0; {63080#true} is VALID [2022-02-20 18:39:44,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {63080#true} assume 0 == ~mode1~0 % 256; {63080#true} is VALID [2022-02-20 18:39:44,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {63080#true} assume 0 == ~mode2~0 % 256; {63080#true} is VALID [2022-02-20 18:39:44,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {63080#true} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1790~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1790~0; {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:44,092 INFO L290 TraceCheckUtils]: 41: Hoare triple {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:44,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:44,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 2; {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:44,093 INFO L290 TraceCheckUtils]: 44: Hoare triple {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep12~0 % 256); {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:44,093 INFO L290 TraceCheckUtils]: 45: Hoare triple {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep13~0 % 256); {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:44,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:44,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:44,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:44,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep21~0 % 256); {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:44,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep23~0 % 256); {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:44,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:39:44,095 INFO L290 TraceCheckUtils]: 52: Hoare triple {63082#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256); {63081#false} is VALID [2022-02-20 18:39:44,095 INFO L290 TraceCheckUtils]: 53: Hoare triple {63081#false} assume !(255 == ~r3~0 % 256); {63081#false} is VALID [2022-02-20 18:39:44,095 INFO L290 TraceCheckUtils]: 54: Hoare triple {63081#false} ~r3~0 := 1 + ~r3~0 % 256; {63081#false} is VALID [2022-02-20 18:39:44,096 INFO L290 TraceCheckUtils]: 55: Hoare triple {63081#false} assume !!(0 == ~ep13~0 % 256); {63081#false} is VALID [2022-02-20 18:39:44,096 INFO L290 TraceCheckUtils]: 56: Hoare triple {63081#false} assume !!(0 == ~ep23~0 % 256); {63081#false} is VALID [2022-02-20 18:39:44,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {63081#false} assume 2 == ~r3~0 % 256; {63081#false} is VALID [2022-02-20 18:39:44,096 INFO L290 TraceCheckUtils]: 58: Hoare triple {63081#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {63081#false} is VALID [2022-02-20 18:39:44,096 INFO L290 TraceCheckUtils]: 59: Hoare triple {63081#false} ~mode3~0 := 0; {63081#false} is VALID [2022-02-20 18:39:44,096 INFO L290 TraceCheckUtils]: 60: Hoare triple {63081#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {63081#false} is VALID [2022-02-20 18:39:44,096 INFO L290 TraceCheckUtils]: 61: Hoare triple {63081#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {63081#false} is VALID [2022-02-20 18:39:44,096 INFO L290 TraceCheckUtils]: 62: Hoare triple {63081#false} ~__return_1921~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1921~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {63081#false} is VALID [2022-02-20 18:39:44,097 INFO L290 TraceCheckUtils]: 63: Hoare triple {63081#false} assume 0 == main_~assert__arg~0#1 % 256; {63081#false} is VALID [2022-02-20 18:39:44,097 INFO L290 TraceCheckUtils]: 64: Hoare triple {63081#false} assume !false; {63081#false} is VALID [2022-02-20 18:39:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:44,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:44,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69897785] [2022-02-20 18:39:44,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69897785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:44,097 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:44,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:44,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629036722] [2022-02-20 18:39:44,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:44,098 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:39:44,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:44,098 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:39:44,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:44,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:44,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:44,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:44,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:44,133 INFO L87 Difference]: Start difference. First operand 3499 states and 5673 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:39:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:50,807 INFO L93 Difference]: Finished difference Result 6917 states and 11273 transitions. [2022-02-20 18:39:50,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:39:50,807 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:39:50,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:50,808 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:39:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2022-02-20 18:39:50,809 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:39:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2022-02-20 18:39:50,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 457 transitions. [2022-02-20 18:39:51,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:52,073 INFO L225 Difference]: With dead ends: 6917 [2022-02-20 18:39:52,073 INFO L226 Difference]: Without dead ends: 4917 [2022-02-20 18:39:52,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:52,076 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 112 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:52,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 446 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2022-02-20 18:39:56,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 4915. [2022-02-20 18:39:56,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:56,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4917 states. Second operand has 4915 states, 4914 states have (on average 1.618030118030118) internal successors, (7951), 4914 states have internal predecessors, (7951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:56,588 INFO L74 IsIncluded]: Start isIncluded. First operand 4917 states. Second operand has 4915 states, 4914 states have (on average 1.618030118030118) internal successors, (7951), 4914 states have internal predecessors, (7951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:56,593 INFO L87 Difference]: Start difference. First operand 4917 states. Second operand has 4915 states, 4914 states have (on average 1.618030118030118) internal successors, (7951), 4914 states have internal predecessors, (7951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:57,192 INFO L93 Difference]: Finished difference Result 4917 states and 7952 transitions. [2022-02-20 18:39:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 4917 states and 7952 transitions. [2022-02-20 18:39:57,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:57,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:57,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 4915 states, 4914 states have (on average 1.618030118030118) internal successors, (7951), 4914 states have internal predecessors, (7951), 0 states have call successors, (0), 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 4917 states. [2022-02-20 18:39:57,206 INFO L87 Difference]: Start difference. First operand has 4915 states, 4914 states have (on average 1.618030118030118) internal successors, (7951), 4914 states have internal predecessors, (7951), 0 states have call successors, (0), 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 4917 states. [2022-02-20 18:39:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:57,808 INFO L93 Difference]: Finished difference Result 4917 states and 7952 transitions. [2022-02-20 18:39:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4917 states and 7952 transitions. [2022-02-20 18:39:57,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:57,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:57,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:57,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4915 states, 4914 states have (on average 1.618030118030118) internal successors, (7951), 4914 states have internal predecessors, (7951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4915 states to 4915 states and 7951 transitions. [2022-02-20 18:39:58,826 INFO L78 Accepts]: Start accepts. Automaton has 4915 states and 7951 transitions. Word has length 65 [2022-02-20 18:39:58,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:58,827 INFO L470 AbstractCegarLoop]: Abstraction has 4915 states and 7951 transitions. [2022-02-20 18:39:58,827 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:39:58,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4915 states and 7951 transitions. [2022-02-20 18:39:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:39:58,828 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:58,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:58,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:39:58,828 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash 629635603, now seen corresponding path program 1 times [2022-02-20 18:39:58,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:58,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508848174] [2022-02-20 18:39:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:58,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:58,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {90290#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1790~0 := 0;~__return_1921~0 := 0; {90290#true} is VALID [2022-02-20 18:39:58,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {90290#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {90290#true} is VALID [2022-02-20 18:39:58,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {90290#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {90290#true} is VALID [2022-02-20 18:39:58,879 INFO L290 TraceCheckUtils]: 3: Hoare triple {90290#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {90290#true} is VALID [2022-02-20 18:39:58,880 INFO L290 TraceCheckUtils]: 4: Hoare triple {90290#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {90290#true} is VALID [2022-02-20 18:39:58,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {90290#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {90290#true} is VALID [2022-02-20 18:39:58,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {90290#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {90290#true} is VALID [2022-02-20 18:39:58,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {90290#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {90290#true} is VALID [2022-02-20 18:39:58,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {90290#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {90290#true} is VALID [2022-02-20 18:39:58,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {90290#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {90290#true} is VALID [2022-02-20 18:39:58,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {90290#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {90290#true} is VALID [2022-02-20 18:39:58,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {90290#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {90290#true} is VALID [2022-02-20 18:39:58,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {90290#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {90290#true} is VALID [2022-02-20 18:39:58,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {90290#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {90290#true} is VALID [2022-02-20 18:39:58,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {90290#true} assume ~id1~0 != ~id2~0; {90290#true} is VALID [2022-02-20 18:39:58,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {90290#true} assume ~id1~0 != ~id3~0; {90290#true} is VALID [2022-02-20 18:39:58,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {90290#true} assume ~id2~0 != ~id3~0; {90290#true} is VALID [2022-02-20 18:39:58,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {90290#true} assume ~id1~0 >= 0; {90290#true} is VALID [2022-02-20 18:39:58,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {90290#true} assume ~id2~0 >= 0; {90290#true} is VALID [2022-02-20 18:39:58,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {90290#true} assume ~id3~0 >= 0; {90290#true} is VALID [2022-02-20 18:39:58,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {90290#true} assume 0 == ~r1~0 % 256; {90290#true} is VALID [2022-02-20 18:39:58,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {90290#true} assume 0 == ~r2~0 % 256; {90290#true} is VALID [2022-02-20 18:39:58,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {90290#true} assume 0 == ~r3~0 % 256; {90290#true} is VALID [2022-02-20 18:39:58,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {90290#true} assume !(0 == main_~init__r122~0#1 % 256); {90290#true} is VALID [2022-02-20 18:39:58,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {90290#true} assume !(0 == main_~init__r132~0#1 % 256); {90290#true} is VALID [2022-02-20 18:39:58,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {90290#true} assume !(0 == main_~init__r212~0#1 % 256); {90290#true} is VALID [2022-02-20 18:39:58,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {90290#true} assume !(0 == main_~init__r232~0#1 % 256); {90290#true} is VALID [2022-02-20 18:39:58,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {90290#true} assume !(0 == main_~init__r312~0#1 % 256); {90290#true} is VALID [2022-02-20 18:39:58,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {90290#true} assume !(0 == main_~init__r322~0#1 % 256); {90290#true} is VALID [2022-02-20 18:39:58,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {90290#true} assume ~max1~0 == ~id1~0; {90290#true} is VALID [2022-02-20 18:39:58,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {90290#true} assume ~max2~0 == ~id2~0; {90290#true} is VALID [2022-02-20 18:39:58,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {90290#true} assume ~max3~0 == ~id3~0; {90290#true} is VALID [2022-02-20 18:39:58,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {90290#true} assume 0 == ~st1~0; {90290#true} is VALID [2022-02-20 18:39:58,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {90290#true} assume 0 == ~st2~0; {90290#true} is VALID [2022-02-20 18:39:58,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {90290#true} assume 0 == ~st3~0; {90292#(<= ~st3~0 0)} is VALID [2022-02-20 18:39:58,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {90292#(<= ~st3~0 0)} assume 0 == ~nl1~0; {90292#(<= ~st3~0 0)} is VALID [2022-02-20 18:39:58,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {90292#(<= ~st3~0 0)} assume 0 == ~nl2~0; {90292#(<= ~st3~0 0)} is VALID [2022-02-20 18:39:58,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {90292#(<= ~st3~0 0)} assume 0 == ~nl3~0; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1790~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1790~0; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode1~0 % 256); {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 2; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep12~0 % 256); {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,887 INFO L290 TraceCheckUtils]: 45: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep13~0 % 256); {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode2~0 % 256); {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep21~0 % 256); {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep23~0 % 256); {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,900 INFO L290 TraceCheckUtils]: 52: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode3~0 % 256); {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,900 INFO L290 TraceCheckUtils]: 53: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,900 INFO L290 TraceCheckUtils]: 54: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep31~0 % 256); {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,901 INFO L290 TraceCheckUtils]: 55: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep32~0 % 256); {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,901 INFO L290 TraceCheckUtils]: 56: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,901 INFO L290 TraceCheckUtils]: 57: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,901 INFO L290 TraceCheckUtils]: 58: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,902 INFO L290 TraceCheckUtils]: 59: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {90293#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:39:58,902 INFO L290 TraceCheckUtils]: 61: Hoare triple {90293#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);main_~check__tmp~0#1 := 0; {90291#false} is VALID [2022-02-20 18:39:58,902 INFO L290 TraceCheckUtils]: 62: Hoare triple {90291#false} ~__return_1921~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1921~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {90291#false} is VALID [2022-02-20 18:39:58,903 INFO L290 TraceCheckUtils]: 63: Hoare triple {90291#false} assume 0 == main_~assert__arg~0#1 % 256; {90291#false} is VALID [2022-02-20 18:39:58,903 INFO L290 TraceCheckUtils]: 64: Hoare triple {90291#false} assume !false; {90291#false} is VALID [2022-02-20 18:39:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:58,903 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:58,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508848174] [2022-02-20 18:39:58,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508848174] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:58,903 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:58,903 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:39:58,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822007589] [2022-02-20 18:39:58,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:58,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:39:58,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:58,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:39:58,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:58,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:39:58,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:58,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:39:58,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:39:58,941 INFO L87 Difference]: Start difference. First operand 4915 states and 7951 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)