./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix039_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/pthread-wmm/mix039_pso.opt.i -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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e95cdca06cefc6ac86cd068b76e72cbec9c86342 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 18:14:09,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:14:09,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:14:09,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:14:09,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:14:09,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:14:09,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:14:09,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:14:09,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:14:09,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:14:09,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:14:09,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:14:09,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:14:09,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:14:09,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:14:09,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:14:09,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:14:09,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:14:09,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:14:09,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:14:09,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:14:09,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:14:09,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:14:09,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:14:09,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:14:09,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:14:09,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:14:09,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:14:09,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:14:09,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:14:09,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:14:09,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:14:09,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:14:09,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:14:09,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:14:09,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:14:09,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:14:09,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:14:09,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:14:09,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:14:09,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:14:09,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:14:09,877 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:14:09,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:14:09,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:14:09,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:14:09,879 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:14:09,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:14:09,880 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:14:09,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:14:09,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:14:09,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:14:09,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:14:09,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:14:09,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:14:09,883 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:14:09,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:14:09,884 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:14:09,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:14:09,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:14:09,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:14:09,885 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:14:09,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:14:09,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:14:09,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:14:09,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:14:09,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:14:09,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:14:09,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:14:09,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:14:09,888 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:14:09,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> e95cdca06cefc6ac86cd068b76e72cbec9c86342 [2019-11-28 18:14:10,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:14:10,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:14:10,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:14:10,241 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:14:10,243 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:14:10,244 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix039_pso.opt.i [2019-11-28 18:14:10,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85abaa0a/82f07259091c41b1bb41dc44b534f688/FLAG337fb6ad5 [2019-11-28 18:14:10,971 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:14:10,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix039_pso.opt.i [2019-11-28 18:14:10,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85abaa0a/82f07259091c41b1bb41dc44b534f688/FLAG337fb6ad5 [2019-11-28 18:14:11,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85abaa0a/82f07259091c41b1bb41dc44b534f688 [2019-11-28 18:14:11,175 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:14:11,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:14:11,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:11,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:14:11,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:14:11,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:11" (1/1) ... [2019-11-28 18:14:11,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c0dead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:11, skipping insertion in model container [2019-11-28 18:14:11,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:11" (1/1) ... [2019-11-28 18:14:11,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:14:11,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:14:11,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:11,719 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:14:11,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:11,890 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:14:11,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:11 WrapperNode [2019-11-28 18:14:11,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:11,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:11,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:14:11,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:14:11,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:11" (1/1) ... [2019-11-28 18:14:11,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:11" (1/1) ... [2019-11-28 18:14:11,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:11,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:14:11,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:14:11,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:14:11,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:11" (1/1) ... [2019-11-28 18:14:11,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:11" (1/1) ... [2019-11-28 18:14:11,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:11" (1/1) ... [2019-11-28 18:14:11,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:11" (1/1) ... [2019-11-28 18:14:11,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:11" (1/1) ... [2019-11-28 18:14:11,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:11" (1/1) ... [2019-11-28 18:14:12,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:11" (1/1) ... [2019-11-28 18:14:12,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:14:12,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:14:12,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:14:12,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:14:12,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:14:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:14:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:14:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:14:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:14:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:14:12,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:14:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:14:12,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:14:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:14:12,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:14:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-11-28 18:14:12,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-11-28 18:14:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:14:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:14:12,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:14:12,099 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:14:12,830 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:14:12,831 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:14:12,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:12 BoogieIcfgContainer [2019-11-28 18:14:12,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:14:12,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:14:12,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:14:12,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:14:12,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:14:11" (1/3) ... [2019-11-28 18:14:12,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ae1771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:14:12, skipping insertion in model container [2019-11-28 18:14:12,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:11" (2/3) ... [2019-11-28 18:14:12,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ae1771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:14:12, skipping insertion in model container [2019-11-28 18:14:12,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:12" (3/3) ... [2019-11-28 18:14:12,842 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_pso.opt.i [2019-11-28 18:14:12,853 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:14:12,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:14:12,862 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:14:12,863 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:14:12,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,905 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,906 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,907 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,908 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,911 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,911 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,940 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,941 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,941 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,941 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,942 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,942 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,942 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,943 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,944 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,945 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,946 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,946 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,946 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:12,973 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-28 18:14:12,995 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:14:12,995 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:14:12,995 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:14:12,996 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:14:12,996 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:14:12,996 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:14:12,996 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:14:12,997 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:14:13,015 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-11-28 18:14:13,018 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-11-28 18:14:13,119 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-11-28 18:14:13,120 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:14:13,136 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-11-28 18:14:13,162 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-11-28 18:14:13,215 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-11-28 18:14:13,215 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:14:13,225 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-11-28 18:14:13,249 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-11-28 18:14:13,250 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:14:17,760 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 18:14:17,882 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 18:14:18,213 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-28 18:14:18,597 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-11-28 18:14:18,740 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-28 18:14:18,759 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-11-28 18:14:18,759 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-11-28 18:14:18,763 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-11-28 18:14:20,366 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-11-28 18:14:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-11-28 18:14:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 18:14:20,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:20,376 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:20,377 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:20,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:20,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-11-28 18:14:20,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:20,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465014609] [2019-11-28 18:14:20,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:20,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465014609] [2019-11-28 18:14:20,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:20,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:14:20,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960275906] [2019-11-28 18:14:20,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:20,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:20,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:20,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:20,724 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-11-28 18:14:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:21,299 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-11-28 18:14:21,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:21,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 18:14:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:21,562 INFO L225 Difference]: With dead ends: 20958 [2019-11-28 18:14:21,562 INFO L226 Difference]: Without dead ends: 19662 [2019-11-28 18:14:21,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-11-28 18:14:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-11-28 18:14:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-11-28 18:14:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-11-28 18:14:22,862 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-11-28 18:14:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:22,864 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-11-28 18:14:22,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-11-28 18:14:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 18:14:22,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:22,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:22,879 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:22,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:22,879 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-11-28 18:14:22,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:22,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89868919] [2019-11-28 18:14:22,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:23,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89868919] [2019-11-28 18:14:23,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:23,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:23,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722721598] [2019-11-28 18:14:23,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:23,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:23,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:23,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:23,049 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-11-28 18:14:23,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:23,690 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-11-28 18:14:23,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:14:23,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 18:14:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:23,876 INFO L225 Difference]: With dead ends: 30494 [2019-11-28 18:14:23,877 INFO L226 Difference]: Without dead ends: 30438 [2019-11-28 18:14:23,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-11-28 18:14:25,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-11-28 18:14:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-11-28 18:14:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-11-28 18:14:25,519 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-11-28 18:14:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:25,520 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-11-28 18:14:25,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-11-28 18:14:25,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:14:25,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:25,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:25,528 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:25,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:25,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-11-28 18:14:25,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:25,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395005473] [2019-11-28 18:14:25,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:25,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395005473] [2019-11-28 18:14:25,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:25,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:25,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903511036] [2019-11-28 18:14:25,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:25,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:25,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:25,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:25,625 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-11-28 18:14:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:25,967 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-11-28 18:14:25,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:14:25,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 18:14:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:26,214 INFO L225 Difference]: With dead ends: 35230 [2019-11-28 18:14:26,215 INFO L226 Difference]: Without dead ends: 35182 [2019-11-28 18:14:26,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-11-28 18:14:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-11-28 18:14:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-11-28 18:14:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-11-28 18:14:27,914 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-11-28 18:14:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:27,914 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-11-28 18:14:27,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-11-28 18:14:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 18:14:27,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:27,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:27,929 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:27,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:27,929 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-11-28 18:14:27,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:27,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785271092] [2019-11-28 18:14:27,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:28,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785271092] [2019-11-28 18:14:28,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:28,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:28,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87941979] [2019-11-28 18:14:28,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:28,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:28,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:28,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:28,023 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-11-28 18:14:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:28,184 INFO L93 Difference]: Finished difference Result 30378 states and 125828 transitions. [2019-11-28 18:14:28,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:28,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 18:14:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:28,301 INFO L225 Difference]: With dead ends: 30378 [2019-11-28 18:14:28,301 INFO L226 Difference]: Without dead ends: 30378 [2019-11-28 18:14:28,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30378 states. [2019-11-28 18:14:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30378 to 29978. [2019-11-28 18:14:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29978 states. [2019-11-28 18:14:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29978 states to 29978 states and 124268 transitions. [2019-11-28 18:14:29,259 INFO L78 Accepts]: Start accepts. Automaton has 29978 states and 124268 transitions. Word has length 20 [2019-11-28 18:14:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:29,259 INFO L462 AbstractCegarLoop]: Abstraction has 29978 states and 124268 transitions. [2019-11-28 18:14:29,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 29978 states and 124268 transitions. [2019-11-28 18:14:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 18:14:29,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:29,272 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:29,272 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:29,273 INFO L82 PathProgramCache]: Analyzing trace with hash -405590648, now seen corresponding path program 1 times [2019-11-28 18:14:29,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:29,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967292911] [2019-11-28 18:14:29,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:29,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967292911] [2019-11-28 18:14:29,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:29,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:29,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439466237] [2019-11-28 18:14:29,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:29,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:29,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:29,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:29,357 INFO L87 Difference]: Start difference. First operand 29978 states and 124268 transitions. Second operand 4 states. [2019-11-28 18:14:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:30,330 INFO L93 Difference]: Finished difference Result 25451 states and 97159 transitions. [2019-11-28 18:14:30,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:30,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-28 18:14:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:30,391 INFO L225 Difference]: With dead ends: 25451 [2019-11-28 18:14:30,391 INFO L226 Difference]: Without dead ends: 23699 [2019-11-28 18:14:30,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:30,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23699 states. [2019-11-28 18:14:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23699 to 23699. [2019-11-28 18:14:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23699 states. [2019-11-28 18:14:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23699 states to 23699 states and 91015 transitions. [2019-11-28 18:14:30,888 INFO L78 Accepts]: Start accepts. Automaton has 23699 states and 91015 transitions. Word has length 20 [2019-11-28 18:14:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:30,888 INFO L462 AbstractCegarLoop]: Abstraction has 23699 states and 91015 transitions. [2019-11-28 18:14:30,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 23699 states and 91015 transitions. [2019-11-28 18:14:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 18:14:30,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:30,898 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:30,898 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:30,899 INFO L82 PathProgramCache]: Analyzing trace with hash -488858070, now seen corresponding path program 1 times [2019-11-28 18:14:30,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:30,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377875477] [2019-11-28 18:14:30,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:30,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377875477] [2019-11-28 18:14:30,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:30,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:30,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007842437] [2019-11-28 18:14:30,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:14:30,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:30,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:14:30,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:30,987 INFO L87 Difference]: Start difference. First operand 23699 states and 91015 transitions. Second operand 5 states. [2019-11-28 18:14:31,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:31,089 INFO L93 Difference]: Finished difference Result 11807 states and 38809 transitions. [2019-11-28 18:14:31,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:14:31,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-28 18:14:31,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:31,107 INFO L225 Difference]: With dead ends: 11807 [2019-11-28 18:14:31,107 INFO L226 Difference]: Without dead ends: 10431 [2019-11-28 18:14:31,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:14:31,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10431 states. [2019-11-28 18:14:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10431 to 10431. [2019-11-28 18:14:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10431 states. [2019-11-28 18:14:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10431 states to 10431 states and 33896 transitions. [2019-11-28 18:14:31,303 INFO L78 Accepts]: Start accepts. Automaton has 10431 states and 33896 transitions. Word has length 21 [2019-11-28 18:14:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:31,304 INFO L462 AbstractCegarLoop]: Abstraction has 10431 states and 33896 transitions. [2019-11-28 18:14:31,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:14:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 10431 states and 33896 transitions. [2019-11-28 18:14:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 18:14:31,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:31,309 INFO L410 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] [2019-11-28 18:14:31,309 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:31,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1838174912, now seen corresponding path program 1 times [2019-11-28 18:14:31,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:31,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016539545] [2019-11-28 18:14:31,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:31,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016539545] [2019-11-28 18:14:31,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:31,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:14:31,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111105931] [2019-11-28 18:14:31,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:31,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:31,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:31,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:31,430 INFO L87 Difference]: Start difference. First operand 10431 states and 33896 transitions. Second operand 6 states. [2019-11-28 18:14:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:31,557 INFO L93 Difference]: Finished difference Result 3272 states and 10004 transitions. [2019-11-28 18:14:31,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:14:31,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 18:14:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:31,565 INFO L225 Difference]: With dead ends: 3272 [2019-11-28 18:14:31,566 INFO L226 Difference]: Without dead ends: 2708 [2019-11-28 18:14:31,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:14:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2019-11-28 18:14:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2019-11-28 18:14:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2708 states. [2019-11-28 18:14:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 8195 transitions. [2019-11-28 18:14:31,634 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 8195 transitions. Word has length 22 [2019-11-28 18:14:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:31,635 INFO L462 AbstractCegarLoop]: Abstraction has 2708 states and 8195 transitions. [2019-11-28 18:14:31,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 8195 transitions. [2019-11-28 18:14:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 18:14:31,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:31,642 INFO L410 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] [2019-11-28 18:14:31,642 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:31,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:31,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-11-28 18:14:31,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:31,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336388195] [2019-11-28 18:14:31,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:31,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336388195] [2019-11-28 18:14:31,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:31,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:31,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753026823] [2019-11-28 18:14:31,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:31,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:31,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:31,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:31,710 INFO L87 Difference]: Start difference. First operand 2708 states and 8195 transitions. Second operand 3 states. [2019-11-28 18:14:31,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:31,766 INFO L93 Difference]: Finished difference Result 4106 states and 12338 transitions. [2019-11-28 18:14:31,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:31,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 18:14:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:31,778 INFO L225 Difference]: With dead ends: 4106 [2019-11-28 18:14:31,779 INFO L226 Difference]: Without dead ends: 4106 [2019-11-28 18:14:31,779 INFO L630 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 [2019-11-28 18:14:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-11-28 18:14:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3200. [2019-11-28 18:14:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3200 states. [2019-11-28 18:14:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 9811 transitions. [2019-11-28 18:14:31,859 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 9811 transitions. Word has length 32 [2019-11-28 18:14:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:31,862 INFO L462 AbstractCegarLoop]: Abstraction has 3200 states and 9811 transitions. [2019-11-28 18:14:31,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 9811 transitions. [2019-11-28 18:14:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 18:14:31,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:31,872 INFO L410 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] [2019-11-28 18:14:31,872 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:31,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:31,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-11-28 18:14:31,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:31,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442306258] [2019-11-28 18:14:31,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:31,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442306258] [2019-11-28 18:14:31,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:31,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:31,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78600740] [2019-11-28 18:14:31,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:31,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:31,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:31,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:31,999 INFO L87 Difference]: Start difference. First operand 3200 states and 9811 transitions. Second operand 6 states. [2019-11-28 18:14:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:32,520 INFO L93 Difference]: Finished difference Result 6768 states and 19665 transitions. [2019-11-28 18:14:32,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:14:32,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-28 18:14:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:32,534 INFO L225 Difference]: With dead ends: 6768 [2019-11-28 18:14:32,534 INFO L226 Difference]: Without dead ends: 6764 [2019-11-28 18:14:32,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:14:32,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6764 states. [2019-11-28 18:14:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6764 to 3476. [2019-11-28 18:14:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3476 states. [2019-11-28 18:14:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 10586 transitions. [2019-11-28 18:14:32,601 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 10586 transitions. Word has length 32 [2019-11-28 18:14:32,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:32,601 INFO L462 AbstractCegarLoop]: Abstraction has 3476 states and 10586 transitions. [2019-11-28 18:14:32,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 10586 transitions. [2019-11-28 18:14:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 18:14:32,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:32,608 INFO L410 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] [2019-11-28 18:14:32,608 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:32,609 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-11-28 18:14:32,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:32,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047528737] [2019-11-28 18:14:32,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:32,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047528737] [2019-11-28 18:14:32,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:32,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:32,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338667973] [2019-11-28 18:14:32,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:32,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:32,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:32,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:32,707 INFO L87 Difference]: Start difference. First operand 3476 states and 10586 transitions. Second operand 6 states. [2019-11-28 18:14:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:33,148 INFO L93 Difference]: Finished difference Result 6621 states and 19118 transitions. [2019-11-28 18:14:33,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:14:33,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-28 18:14:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:33,159 INFO L225 Difference]: With dead ends: 6621 [2019-11-28 18:14:33,160 INFO L226 Difference]: Without dead ends: 6619 [2019-11-28 18:14:33,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:14:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2019-11-28 18:14:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 3328. [2019-11-28 18:14:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3328 states. [2019-11-28 18:14:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 3328 states and 10212 transitions. [2019-11-28 18:14:33,734 INFO L78 Accepts]: Start accepts. Automaton has 3328 states and 10212 transitions. Word has length 33 [2019-11-28 18:14:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:33,735 INFO L462 AbstractCegarLoop]: Abstraction has 3328 states and 10212 transitions. [2019-11-28 18:14:33,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 10212 transitions. [2019-11-28 18:14:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 18:14:33,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:33,740 INFO L410 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] [2019-11-28 18:14:33,741 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:33,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:33,741 INFO L82 PathProgramCache]: Analyzing trace with hash 452387979, now seen corresponding path program 1 times [2019-11-28 18:14:33,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:33,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999937055] [2019-11-28 18:14:33,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:33,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999937055] [2019-11-28 18:14:33,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:33,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:14:33,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238823964] [2019-11-28 18:14:33,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:14:33,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:33,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:14:33,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:14:33,916 INFO L87 Difference]: Start difference. First operand 3328 states and 10212 transitions. Second operand 7 states. [2019-11-28 18:14:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:34,044 INFO L93 Difference]: Finished difference Result 2519 states and 8206 transitions. [2019-11-28 18:14:34,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:14:34,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-11-28 18:14:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:34,051 INFO L225 Difference]: With dead ends: 2519 [2019-11-28 18:14:34,052 INFO L226 Difference]: Without dead ends: 2442 [2019-11-28 18:14:34,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:14:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2019-11-28 18:14:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2370. [2019-11-28 18:14:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2019-11-28 18:14:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 7792 transitions. [2019-11-28 18:14:34,105 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 7792 transitions. Word has length 33 [2019-11-28 18:14:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:34,105 INFO L462 AbstractCegarLoop]: Abstraction has 2370 states and 7792 transitions. [2019-11-28 18:14:34,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:14:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 7792 transitions. [2019-11-28 18:14:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 18:14:34,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:34,115 INFO L410 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] [2019-11-28 18:14:34,115 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:34,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:34,116 INFO L82 PathProgramCache]: Analyzing trace with hash -754041251, now seen corresponding path program 1 times [2019-11-28 18:14:34,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:34,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389462505] [2019-11-28 18:14:34,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:34,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389462505] [2019-11-28 18:14:34,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:34,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 18:14:34,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735828499] [2019-11-28 18:14:34,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 18:14:34,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:34,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 18:14:34,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:14:34,432 INFO L87 Difference]: Start difference. First operand 2370 states and 7792 transitions. Second operand 10 states. [2019-11-28 18:14:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:35,406 INFO L93 Difference]: Finished difference Result 5796 states and 17098 transitions. [2019-11-28 18:14:35,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:14:35,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2019-11-28 18:14:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:35,414 INFO L225 Difference]: With dead ends: 5796 [2019-11-28 18:14:35,415 INFO L226 Difference]: Without dead ends: 3091 [2019-11-28 18:14:35,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-11-28 18:14:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3091 states. [2019-11-28 18:14:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3091 to 2090. [2019-11-28 18:14:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-11-28 18:14:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 6728 transitions. [2019-11-28 18:14:35,467 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 6728 transitions. Word has length 48 [2019-11-28 18:14:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:35,468 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 6728 transitions. [2019-11-28 18:14:35,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 18:14:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 6728 transitions. [2019-11-28 18:14:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 18:14:35,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:35,475 INFO L410 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] [2019-11-28 18:14:35,475 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:35,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:35,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1894134845, now seen corresponding path program 2 times [2019-11-28 18:14:35,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:35,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225395876] [2019-11-28 18:14:35,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:35,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225395876] [2019-11-28 18:14:35,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:35,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:35,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208296555] [2019-11-28 18:14:35,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:14:35,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:35,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:14:35,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:35,658 INFO L87 Difference]: Start difference. First operand 2090 states and 6728 transitions. Second operand 5 states. [2019-11-28 18:14:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:35,728 INFO L93 Difference]: Finished difference Result 3516 states and 10526 transitions. [2019-11-28 18:14:35,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:14:35,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-28 18:14:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:35,734 INFO L225 Difference]: With dead ends: 3516 [2019-11-28 18:14:35,734 INFO L226 Difference]: Without dead ends: 1792 [2019-11-28 18:14:35,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:14:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2019-11-28 18:14:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1437. [2019-11-28 18:14:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1437 states. [2019-11-28 18:14:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 4156 transitions. [2019-11-28 18:14:35,764 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 4156 transitions. Word has length 48 [2019-11-28 18:14:35,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:35,765 INFO L462 AbstractCegarLoop]: Abstraction has 1437 states and 4156 transitions. [2019-11-28 18:14:35,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:14:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 4156 transitions. [2019-11-28 18:14:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 18:14:35,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:35,769 INFO L410 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] [2019-11-28 18:14:35,770 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:35,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash -978641481, now seen corresponding path program 3 times [2019-11-28 18:14:35,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:35,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886770122] [2019-11-28 18:14:35,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:36,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886770122] [2019-11-28 18:14:36,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:36,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 18:14:36,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882180270] [2019-11-28 18:14:36,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 18:14:36,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:36,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 18:14:36,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:14:36,095 INFO L87 Difference]: Start difference. First operand 1437 states and 4156 transitions. Second operand 11 states. [2019-11-28 18:14:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:39,223 INFO L93 Difference]: Finished difference Result 5918 states and 16053 transitions. [2019-11-28 18:14:39,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-28 18:14:39,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-11-28 18:14:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:39,229 INFO L225 Difference]: With dead ends: 5918 [2019-11-28 18:14:39,229 INFO L226 Difference]: Without dead ends: 3079 [2019-11-28 18:14:39,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 18:14:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2019-11-28 18:14:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 1678. [2019-11-28 18:14:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2019-11-28 18:14:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 4825 transitions. [2019-11-28 18:14:39,259 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 4825 transitions. Word has length 48 [2019-11-28 18:14:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:39,259 INFO L462 AbstractCegarLoop]: Abstraction has 1678 states and 4825 transitions. [2019-11-28 18:14:39,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 18:14:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 4825 transitions. [2019-11-28 18:14:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 18:14:39,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:39,262 INFO L410 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] [2019-11-28 18:14:39,262 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:39,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:39,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1081062049, now seen corresponding path program 4 times [2019-11-28 18:14:39,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:39,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535570796] [2019-11-28 18:14:39,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:39,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535570796] [2019-11-28 18:14:39,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:39,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:39,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381089977] [2019-11-28 18:14:39,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:39,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:39,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:39,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:39,361 INFO L87 Difference]: Start difference. First operand 1678 states and 4825 transitions. Second operand 4 states. [2019-11-28 18:14:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:39,386 INFO L93 Difference]: Finished difference Result 2128 states and 5848 transitions. [2019-11-28 18:14:39,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:39,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-28 18:14:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:39,388 INFO L225 Difference]: With dead ends: 2128 [2019-11-28 18:14:39,389 INFO L226 Difference]: Without dead ends: 522 [2019-11-28 18:14:39,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-28 18:14:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2019-11-28 18:14:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-11-28 18:14:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1153 transitions. [2019-11-28 18:14:39,397 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1153 transitions. Word has length 48 [2019-11-28 18:14:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:39,398 INFO L462 AbstractCegarLoop]: Abstraction has 522 states and 1153 transitions. [2019-11-28 18:14:39,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1153 transitions. [2019-11-28 18:14:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 18:14:39,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:39,399 INFO L410 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] [2019-11-28 18:14:39,400 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 5 times [2019-11-28 18:14:39,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:39,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726508979] [2019-11-28 18:14:39,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:14:39,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726508979] [2019-11-28 18:14:39,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:39,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:14:39,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403414090] [2019-11-28 18:14:39,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:14:39,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:39,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:14:39,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:14:39,542 INFO L87 Difference]: Start difference. First operand 522 states and 1153 transitions. Second operand 7 states. [2019-11-28 18:14:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:39,806 INFO L93 Difference]: Finished difference Result 892 states and 1946 transitions. [2019-11-28 18:14:39,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 18:14:39,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-11-28 18:14:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:39,808 INFO L225 Difference]: With dead ends: 892 [2019-11-28 18:14:39,808 INFO L226 Difference]: Without dead ends: 570 [2019-11-28 18:14:39,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:14:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-28 18:14:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 512. [2019-11-28 18:14:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-28 18:14:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1123 transitions. [2019-11-28 18:14:39,818 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1123 transitions. Word has length 48 [2019-11-28 18:14:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:39,818 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 1123 transitions. [2019-11-28 18:14:39,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:14:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1123 transitions. [2019-11-28 18:14:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 18:14:39,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:39,820 INFO L410 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] [2019-11-28 18:14:39,821 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:39,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:39,821 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 6 times [2019-11-28 18:14:39,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:39,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882051380] [2019-11-28 18:14:39,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:14:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:14:39,952 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:14:39,953 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:14:39,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1037~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1037~0.base_71|) |v_ULTIMATE.start_main_~#t1037~0.offset_43| 0)) |v_#memory_int_27|) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1037~0.base_71|) 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= 0 |v_ULTIMATE.start_main_~#t1037~0.offset_43|) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= |v_#NULL.offset_5| 0) (= v_~weak$$choice2~0_111 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1037~0.base_71| 4)) (= 0 v_~z$r_buff0_thd3~0_266) (= (store .cse0 |v_ULTIMATE.start_main_~#t1037~0.base_71| 1) |v_#valid_117|) (= v_~x~0_36 0) (= v_~y~0_68 0) (= v_~z$w_buff1_used~0_298 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1037~0.base_71|) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_55))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t1040~0.offset=|v_ULTIMATE.start_main_~#t1040~0.offset_24|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, ULTIMATE.start_main_~#t1038~0.base=|v_ULTIMATE.start_main_~#t1038~0.base_68|, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start_main_~#t1039~0.base=|v_ULTIMATE.start_main_~#t1039~0.base_36|, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_36, ULTIMATE.start_main_~#t1037~0.offset=|v_ULTIMATE.start_main_~#t1037~0.offset_43|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ULTIMATE.start_main_~#t1040~0.base=|v_ULTIMATE.start_main_~#t1040~0.base_36|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1037~0.base=|v_ULTIMATE.start_main_~#t1037~0.base_71|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ULTIMATE.start_main_~#t1039~0.offset=|v_ULTIMATE.start_main_~#t1039~0.offset_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ULTIMATE.start_main_~#t1038~0.offset=|v_ULTIMATE.start_main_~#t1038~0.offset_41|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1040~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t1038~0.base, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1039~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1037~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t1040~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1037~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1039~0.offset, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1038~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:14:39,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1038~0.base_11| 0)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1038~0.base_11| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1038~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1038~0.base_11|) |v_ULTIMATE.start_main_~#t1038~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1038~0.base_11| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1038~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1038~0.offset_10|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1038~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1038~0.offset=|v_ULTIMATE.start_main_~#t1038~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1038~0.base=|v_ULTIMATE.start_main_~#t1038~0.base_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1038~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1038~0.base, #length] because there is no mapped edge [2019-11-28 18:14:39,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1039~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1039~0.offset_11|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1039~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1039~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1039~0.base_12|) |v_ULTIMATE.start_main_~#t1039~0.offset_11| 2)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1039~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1039~0.base_12| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1039~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1039~0.base=|v_ULTIMATE.start_main_~#t1039~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1039~0.offset=|v_ULTIMATE.start_main_~#t1039~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1039~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1039~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:14:39,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1040~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1040~0.base_12|) |v_ULTIMATE.start_main_~#t1040~0.offset_10| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1040~0.base_12|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1040~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1040~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1040~0.offset_10| 0) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1040~0.base_12| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1040~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1040~0.offset=|v_ULTIMATE.start_main_~#t1040~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t1040~0.base=|v_ULTIMATE.start_main_~#t1040~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1040~0.offset, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1040~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:14:39,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= 1 ~a~0_Out-1798706593) (= ~__unbuffered_p3_EBX~0_Out-1798706593 ~b~0_In-1798706593) (= ~z$r_buff1_thd2~0_Out-1798706593 ~z$r_buff0_thd2~0_In-1798706593) (= ~z$r_buff0_thd0~0_In-1798706593 ~z$r_buff1_thd0~0_Out-1798706593) (= ~a~0_Out-1798706593 ~__unbuffered_p3_EAX~0_Out-1798706593) (= ~z$r_buff1_thd3~0_Out-1798706593 ~z$r_buff0_thd3~0_In-1798706593) (= 1 ~z$r_buff0_thd4~0_Out-1798706593) (= ~z$r_buff1_thd4~0_Out-1798706593 ~z$r_buff0_thd4~0_In-1798706593) (= ~z$r_buff0_thd1~0_In-1798706593 ~z$r_buff1_thd1~0_Out-1798706593) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1798706593))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1798706593, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1798706593, ~b~0=~b~0_In-1798706593, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1798706593, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1798706593, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1798706593, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1798706593} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1798706593, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1798706593, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1798706593, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1798706593, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1798706593, ~a~0=~a~0_Out-1798706593, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1798706593, ~b~0=~b~0_In-1798706593, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1798706593, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1798706593, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1798706593, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1798706593, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1798706593, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1798706593, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1798706593} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-11-28 18:14:39,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-11-28 18:14:39,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y~0_18 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-11-28 18:14:39,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-943910123 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_Out-943910123| ~z$w_buff0~0_In-943910123) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-943910123 256)))) (or (= (mod ~z$w_buff0_used~0_In-943910123 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In-943910123 256) 0) .cse0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-943910123 256))))) (= |P2Thread1of1ForFork1_#t~ite8_Out-943910123| |P2Thread1of1ForFork1_#t~ite9_Out-943910123|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite8_In-943910123| |P2Thread1of1ForFork1_#t~ite8_Out-943910123|) (= ~z$w_buff0~0_In-943910123 |P2Thread1of1ForFork1_#t~ite9_Out-943910123|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-943910123, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-943910123, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-943910123, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-943910123, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-943910123, ~weak$$choice2~0=~weak$$choice2~0_In-943910123, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-943910123|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-943910123, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-943910123, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-943910123, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-943910123, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-943910123, ~weak$$choice2~0=~weak$$choice2~0_In-943910123, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-943910123|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-943910123|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:14:39,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1652416763 256) 0))) (or (and (= ~z$w_buff1~0_In1652416763 |P2Thread1of1ForFork1_#t~ite11_Out1652416763|) .cse0 (= |P2Thread1of1ForFork1_#t~ite11_Out1652416763| |P2Thread1of1ForFork1_#t~ite12_Out1652416763|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1652416763 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1652416763 256) 0)) (and (= 0 (mod ~z$w_buff1_used~0_In1652416763 256)) .cse1) (= (mod ~z$w_buff0_used~0_In1652416763 256) 0)))) (and (= |P2Thread1of1ForFork1_#t~ite11_In1652416763| |P2Thread1of1ForFork1_#t~ite11_Out1652416763|) (= ~z$w_buff1~0_In1652416763 |P2Thread1of1ForFork1_#t~ite12_Out1652416763|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1652416763, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1652416763, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1652416763|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1652416763, ~z$w_buff1~0=~z$w_buff1~0_In1652416763, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1652416763, ~weak$$choice2~0=~weak$$choice2~0_In1652416763} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1652416763, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1652416763|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1652416763, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1652416763|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1652416763, ~z$w_buff1~0=~z$w_buff1~0_In1652416763, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1652416763, ~weak$$choice2~0=~weak$$choice2~0_In1652416763} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:14:39,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1014893232 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_In1014893232| |P2Thread1of1ForFork1_#t~ite14_Out1014893232|) (not .cse0) (= ~z$w_buff0_used~0_In1014893232 |P2Thread1of1ForFork1_#t~ite15_Out1014893232|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1014893232 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1014893232 256) 0)) (and (= (mod ~z$r_buff1_thd3~0_In1014893232 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1014893232 256)))) (= |P2Thread1of1ForFork1_#t~ite15_Out1014893232| |P2Thread1of1ForFork1_#t~ite14_Out1014893232|) (= ~z$w_buff0_used~0_In1014893232 |P2Thread1of1ForFork1_#t~ite14_Out1014893232|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1014893232|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1014893232, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1014893232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1014893232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1014893232, ~weak$$choice2~0=~weak$$choice2~0_In1014893232} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1014893232|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1014893232|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1014893232, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1014893232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1014893232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1014893232, ~weak$$choice2~0=~weak$$choice2~0_In1014893232} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-11-28 18:14:39,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:14:39,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-403983051 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-403983051 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-403983051 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-403983051 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-403983051 256)) .cse1))) (= ~z$r_buff1_thd3~0_In-403983051 |P2Thread1of1ForFork1_#t~ite23_Out-403983051|) (= |P2Thread1of1ForFork1_#t~ite23_Out-403983051| |P2Thread1of1ForFork1_#t~ite24_Out-403983051|)) (and (= |P2Thread1of1ForFork1_#t~ite23_In-403983051| |P2Thread1of1ForFork1_#t~ite23_Out-403983051|) (not .cse0) (= ~z$r_buff1_thd3~0_In-403983051 |P2Thread1of1ForFork1_#t~ite24_Out-403983051|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-403983051, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-403983051, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-403983051|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-403983051, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-403983051, ~weak$$choice2~0=~weak$$choice2~0_In-403983051} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-403983051|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-403983051, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-403983051, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-403983051|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-403983051, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-403983051, ~weak$$choice2~0=~weak$$choice2~0_In-403983051} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-11-28 18:14:39,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:14:39,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In2015371789 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2015371789 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out2015371789| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In2015371789 |P3Thread1of1ForFork2_#t~ite28_Out2015371789|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2015371789, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2015371789} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out2015371789|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2015371789, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2015371789} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:14:39,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1841947224 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1841947224 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1841947224 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1841947224 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite29_Out-1841947224| ~z$w_buff1_used~0_In-1841947224) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork2_#t~ite29_Out-1841947224| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1841947224, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1841947224, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1841947224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1841947224} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1841947224|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1841947224, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1841947224, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1841947224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1841947224} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:14:39,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= ~z$r_buff0_thd4~0_Out-1361805737 ~z$r_buff0_thd4~0_In-1361805737)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1361805737 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1361805737 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse1) (not .cse2) (= 0 ~z$r_buff0_thd4~0_Out-1361805737)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1361805737, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1361805737} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1361805737, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1361805737, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-1361805737|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-11-28 18:14:39,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1567806194 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1567806194 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1567806194 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In1567806194 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out1567806194| ~z$r_buff1_thd4~0_In1567806194) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork2_#t~ite31_Out1567806194| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1567806194, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567806194, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1567806194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1567806194} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1567806194, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567806194, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1567806194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1567806194, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1567806194|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:14:39,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:14:39,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:14:39,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite37_Out-1165191590| |ULTIMATE.start_main_#t~ite36_Out-1165191590|)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1165191590 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1165191590 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-1165191590 |ULTIMATE.start_main_#t~ite36_Out-1165191590|)) (and .cse2 (= ~z$w_buff1~0_In-1165191590 |ULTIMATE.start_main_#t~ite36_Out-1165191590|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1165191590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1165191590, ~z$w_buff1~0=~z$w_buff1~0_In-1165191590, ~z~0=~z~0_In-1165191590} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1165191590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1165191590, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1165191590|, ~z$w_buff1~0=~z$w_buff1~0_In-1165191590, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1165191590|, ~z~0=~z~0_In-1165191590} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:14:39,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1296184931 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1296184931 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1296184931| ~z$w_buff0_used~0_In-1296184931)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1296184931| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1296184931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1296184931} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1296184931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1296184931, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1296184931|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:14:39,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1813422452 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1813422452 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1813422452 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1813422452 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1813422452|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1813422452 |ULTIMATE.start_main_#t~ite39_Out-1813422452|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1813422452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1813422452, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1813422452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1813422452} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1813422452, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1813422452|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1813422452, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1813422452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1813422452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:14:39,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In579385929 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In579385929 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out579385929| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out579385929| ~z$r_buff0_thd0~0_In579385929)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In579385929, ~z$w_buff0_used~0=~z$w_buff0_used~0_In579385929} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In579385929, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out579385929|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In579385929} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:14:39,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1382959296 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1382959296 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1382959296 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1382959296 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite41_Out1382959296|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1382959296 |ULTIMATE.start_main_#t~ite41_Out1382959296|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1382959296, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1382959296, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1382959296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1382959296} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1382959296|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1382959296, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1382959296, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1382959296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1382959296} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-11-28 18:14:39,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:14:40,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:14:40 BasicIcfg [2019-11-28 18:14:40,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:14:40,090 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:14:40,090 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:14:40,090 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:14:40,091 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:12" (3/4) ... [2019-11-28 18:14:40,094 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:14:40,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1037~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1037~0.base_71|) |v_ULTIMATE.start_main_~#t1037~0.offset_43| 0)) |v_#memory_int_27|) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1037~0.base_71|) 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= 0 |v_ULTIMATE.start_main_~#t1037~0.offset_43|) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= |v_#NULL.offset_5| 0) (= v_~weak$$choice2~0_111 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1037~0.base_71| 4)) (= 0 v_~z$r_buff0_thd3~0_266) (= (store .cse0 |v_ULTIMATE.start_main_~#t1037~0.base_71| 1) |v_#valid_117|) (= v_~x~0_36 0) (= v_~y~0_68 0) (= v_~z$w_buff1_used~0_298 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1037~0.base_71|) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_55))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t1040~0.offset=|v_ULTIMATE.start_main_~#t1040~0.offset_24|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, ULTIMATE.start_main_~#t1038~0.base=|v_ULTIMATE.start_main_~#t1038~0.base_68|, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ULTIMATE.start_main_~#t1039~0.base=|v_ULTIMATE.start_main_~#t1039~0.base_36|, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_36, ULTIMATE.start_main_~#t1037~0.offset=|v_ULTIMATE.start_main_~#t1037~0.offset_43|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ULTIMATE.start_main_~#t1040~0.base=|v_ULTIMATE.start_main_~#t1040~0.base_36|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1037~0.base=|v_ULTIMATE.start_main_~#t1037~0.base_71|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ULTIMATE.start_main_~#t1039~0.offset=|v_ULTIMATE.start_main_~#t1039~0.offset_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ULTIMATE.start_main_~#t1038~0.offset=|v_ULTIMATE.start_main_~#t1038~0.offset_41|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1040~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t1038~0.base, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1039~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1037~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t1040~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1037~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1039~0.offset, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1038~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:14:40,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1038~0.base_11| 0)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1038~0.base_11| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1038~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1038~0.base_11|) |v_ULTIMATE.start_main_~#t1038~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1038~0.base_11| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1038~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1038~0.offset_10|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1038~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1038~0.offset=|v_ULTIMATE.start_main_~#t1038~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1038~0.base=|v_ULTIMATE.start_main_~#t1038~0.base_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1038~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1038~0.base, #length] because there is no mapped edge [2019-11-28 18:14:40,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1039~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1039~0.offset_11|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1039~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1039~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1039~0.base_12|) |v_ULTIMATE.start_main_~#t1039~0.offset_11| 2)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1039~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1039~0.base_12| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1039~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1039~0.base=|v_ULTIMATE.start_main_~#t1039~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1039~0.offset=|v_ULTIMATE.start_main_~#t1039~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1039~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1039~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:14:40,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1040~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1040~0.base_12|) |v_ULTIMATE.start_main_~#t1040~0.offset_10| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1040~0.base_12|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1040~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1040~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1040~0.offset_10| 0) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1040~0.base_12| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1040~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1040~0.offset=|v_ULTIMATE.start_main_~#t1040~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t1040~0.base=|v_ULTIMATE.start_main_~#t1040~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1040~0.offset, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1040~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:14:40,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= 1 ~a~0_Out-1798706593) (= ~__unbuffered_p3_EBX~0_Out-1798706593 ~b~0_In-1798706593) (= ~z$r_buff1_thd2~0_Out-1798706593 ~z$r_buff0_thd2~0_In-1798706593) (= ~z$r_buff0_thd0~0_In-1798706593 ~z$r_buff1_thd0~0_Out-1798706593) (= ~a~0_Out-1798706593 ~__unbuffered_p3_EAX~0_Out-1798706593) (= ~z$r_buff1_thd3~0_Out-1798706593 ~z$r_buff0_thd3~0_In-1798706593) (= 1 ~z$r_buff0_thd4~0_Out-1798706593) (= ~z$r_buff1_thd4~0_Out-1798706593 ~z$r_buff0_thd4~0_In-1798706593) (= ~z$r_buff0_thd1~0_In-1798706593 ~z$r_buff1_thd1~0_Out-1798706593) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1798706593))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1798706593, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1798706593, ~b~0=~b~0_In-1798706593, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1798706593, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1798706593, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1798706593, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1798706593} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1798706593, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1798706593, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1798706593, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1798706593, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1798706593, ~a~0=~a~0_Out-1798706593, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1798706593, ~b~0=~b~0_In-1798706593, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1798706593, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1798706593, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1798706593, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1798706593, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1798706593, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1798706593, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1798706593} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-11-28 18:14:40,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-11-28 18:14:40,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y~0_18 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-11-28 18:14:40,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-943910123 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_Out-943910123| ~z$w_buff0~0_In-943910123) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-943910123 256)))) (or (= (mod ~z$w_buff0_used~0_In-943910123 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In-943910123 256) 0) .cse0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-943910123 256))))) (= |P2Thread1of1ForFork1_#t~ite8_Out-943910123| |P2Thread1of1ForFork1_#t~ite9_Out-943910123|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite8_In-943910123| |P2Thread1of1ForFork1_#t~ite8_Out-943910123|) (= ~z$w_buff0~0_In-943910123 |P2Thread1of1ForFork1_#t~ite9_Out-943910123|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-943910123, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-943910123, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-943910123, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-943910123, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-943910123, ~weak$$choice2~0=~weak$$choice2~0_In-943910123, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-943910123|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-943910123, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-943910123, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-943910123, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-943910123, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-943910123, ~weak$$choice2~0=~weak$$choice2~0_In-943910123, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-943910123|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-943910123|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:14:40,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1652416763 256) 0))) (or (and (= ~z$w_buff1~0_In1652416763 |P2Thread1of1ForFork1_#t~ite11_Out1652416763|) .cse0 (= |P2Thread1of1ForFork1_#t~ite11_Out1652416763| |P2Thread1of1ForFork1_#t~ite12_Out1652416763|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1652416763 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1652416763 256) 0)) (and (= 0 (mod ~z$w_buff1_used~0_In1652416763 256)) .cse1) (= (mod ~z$w_buff0_used~0_In1652416763 256) 0)))) (and (= |P2Thread1of1ForFork1_#t~ite11_In1652416763| |P2Thread1of1ForFork1_#t~ite11_Out1652416763|) (= ~z$w_buff1~0_In1652416763 |P2Thread1of1ForFork1_#t~ite12_Out1652416763|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1652416763, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1652416763, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1652416763|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1652416763, ~z$w_buff1~0=~z$w_buff1~0_In1652416763, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1652416763, ~weak$$choice2~0=~weak$$choice2~0_In1652416763} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1652416763, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1652416763|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1652416763, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1652416763|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1652416763, ~z$w_buff1~0=~z$w_buff1~0_In1652416763, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1652416763, ~weak$$choice2~0=~weak$$choice2~0_In1652416763} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:14:40,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1014893232 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_In1014893232| |P2Thread1of1ForFork1_#t~ite14_Out1014893232|) (not .cse0) (= ~z$w_buff0_used~0_In1014893232 |P2Thread1of1ForFork1_#t~ite15_Out1014893232|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1014893232 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1014893232 256) 0)) (and (= (mod ~z$r_buff1_thd3~0_In1014893232 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1014893232 256)))) (= |P2Thread1of1ForFork1_#t~ite15_Out1014893232| |P2Thread1of1ForFork1_#t~ite14_Out1014893232|) (= ~z$w_buff0_used~0_In1014893232 |P2Thread1of1ForFork1_#t~ite14_Out1014893232|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1014893232|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1014893232, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1014893232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1014893232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1014893232, ~weak$$choice2~0=~weak$$choice2~0_In1014893232} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1014893232|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1014893232|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1014893232, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1014893232, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1014893232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1014893232, ~weak$$choice2~0=~weak$$choice2~0_In1014893232} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-11-28 18:14:40,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:14:40,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-403983051 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-403983051 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-403983051 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-403983051 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-403983051 256)) .cse1))) (= ~z$r_buff1_thd3~0_In-403983051 |P2Thread1of1ForFork1_#t~ite23_Out-403983051|) (= |P2Thread1of1ForFork1_#t~ite23_Out-403983051| |P2Thread1of1ForFork1_#t~ite24_Out-403983051|)) (and (= |P2Thread1of1ForFork1_#t~ite23_In-403983051| |P2Thread1of1ForFork1_#t~ite23_Out-403983051|) (not .cse0) (= ~z$r_buff1_thd3~0_In-403983051 |P2Thread1of1ForFork1_#t~ite24_Out-403983051|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-403983051, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-403983051, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-403983051|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-403983051, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-403983051, ~weak$$choice2~0=~weak$$choice2~0_In-403983051} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-403983051|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-403983051, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-403983051, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-403983051|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-403983051, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-403983051, ~weak$$choice2~0=~weak$$choice2~0_In-403983051} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-11-28 18:14:40,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:14:40,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In2015371789 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2015371789 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out2015371789| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In2015371789 |P3Thread1of1ForFork2_#t~ite28_Out2015371789|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2015371789, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2015371789} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out2015371789|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2015371789, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2015371789} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:14:40,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1841947224 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1841947224 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1841947224 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1841947224 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite29_Out-1841947224| ~z$w_buff1_used~0_In-1841947224) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork2_#t~ite29_Out-1841947224| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1841947224, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1841947224, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1841947224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1841947224} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1841947224|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1841947224, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1841947224, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1841947224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1841947224} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:14:40,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= ~z$r_buff0_thd4~0_Out-1361805737 ~z$r_buff0_thd4~0_In-1361805737)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1361805737 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1361805737 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse1) (not .cse2) (= 0 ~z$r_buff0_thd4~0_Out-1361805737)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1361805737, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1361805737} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1361805737, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1361805737, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-1361805737|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-11-28 18:14:40,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1567806194 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1567806194 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1567806194 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In1567806194 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out1567806194| ~z$r_buff1_thd4~0_In1567806194) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork2_#t~ite31_Out1567806194| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1567806194, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567806194, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1567806194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1567806194} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1567806194, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567806194, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1567806194, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1567806194, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1567806194|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:14:40,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:14:40,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:14:40,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite37_Out-1165191590| |ULTIMATE.start_main_#t~ite36_Out-1165191590|)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1165191590 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1165191590 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-1165191590 |ULTIMATE.start_main_#t~ite36_Out-1165191590|)) (and .cse2 (= ~z$w_buff1~0_In-1165191590 |ULTIMATE.start_main_#t~ite36_Out-1165191590|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1165191590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1165191590, ~z$w_buff1~0=~z$w_buff1~0_In-1165191590, ~z~0=~z~0_In-1165191590} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1165191590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1165191590, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1165191590|, ~z$w_buff1~0=~z$w_buff1~0_In-1165191590, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1165191590|, ~z~0=~z~0_In-1165191590} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:14:40,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1296184931 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1296184931 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1296184931| ~z$w_buff0_used~0_In-1296184931)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1296184931| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1296184931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1296184931} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1296184931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1296184931, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1296184931|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:14:40,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1813422452 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1813422452 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1813422452 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1813422452 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-1813422452|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1813422452 |ULTIMATE.start_main_#t~ite39_Out-1813422452|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1813422452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1813422452, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1813422452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1813422452} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1813422452, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1813422452|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1813422452, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1813422452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1813422452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:14:40,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In579385929 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In579385929 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out579385929| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out579385929| ~z$r_buff0_thd0~0_In579385929)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In579385929, ~z$w_buff0_used~0=~z$w_buff0_used~0_In579385929} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In579385929, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out579385929|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In579385929} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:14:40,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1382959296 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1382959296 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1382959296 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1382959296 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite41_Out1382959296|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1382959296 |ULTIMATE.start_main_#t~ite41_Out1382959296|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1382959296, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1382959296, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1382959296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1382959296} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1382959296|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1382959296, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1382959296, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1382959296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1382959296} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-11-28 18:14:40,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:14:40,250 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:14:40,251 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:14:40,253 INFO L168 Benchmark]: Toolchain (without parser) took 29076.32 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 956.3 MB in the beginning and 853.0 MB in the end (delta: 103.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-28 18:14:40,254 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:14:40,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:40,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:40,255 INFO L168 Benchmark]: Boogie Preprocessor took 51.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:14:40,255 INFO L168 Benchmark]: RCFGBuilder took 807.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:40,256 INFO L168 Benchmark]: TraceAbstraction took 27252.91 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 880.2 MB in the end (delta: 172.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-28 18:14:40,256 INFO L168 Benchmark]: Witness Printer took 161.31 ms. Allocated memory is still 2.6 GB. Free memory was 880.2 MB in the beginning and 853.0 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:40,258 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 714.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 807.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27252.91 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 880.2 MB in the end (delta: 172.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 161.31 ms. Allocated memory is still 2.6 GB. Free memory was 880.2 MB in the beginning and 853.0 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5707 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1040, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2253 SDtfs, 3303 SDslu, 5776 SDs, 0 SdLazy, 4029 SolverSat, 261 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30378occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 18272 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 543 NumberOfCodeBlocks, 543 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 110322 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...