./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer --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 f3a6104f4322bbad98945799f6c1be57ba003e9d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-12-07 15:00:37,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:00:37,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:00:37,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:00:37,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:00:37,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:00:37,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:00:37,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:00:37,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:00:37,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:00:37,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:00:37,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:00:37,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:00:37,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:00:37,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:00:37,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:00:37,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:00:37,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:00:37,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:00:37,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:00:37,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:00:37,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:00:37,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:00:37,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:00:37,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:00:37,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:00:37,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:00:37,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:00:37,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:00:37,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:00:37,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:00:37,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:00:37,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:00:37,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:00:37,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:00:37,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:00:37,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:00:37,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:00:37,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:00:37,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:00:37,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:00:37,722 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 15:00:37,731 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:00:37,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:00:37,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:00:37,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:00:37,733 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:00:37,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:00:37,733 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:00:37,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:00:37,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:00:37,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:00:37,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:00:37,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:00:37,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:00:37,734 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:00:37,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:00:37,734 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:00:37,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:00:37,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:00:37,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:00:37,734 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:00:37,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:00:37,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:00:37,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:00:37,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:00:37,735 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:00:37,735 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:00:37,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:00:37,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:00:37,736 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:00:37,736 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer 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 -> f3a6104f4322bbad98945799f6c1be57ba003e9d [2019-12-07 15:00:37,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:00:37,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:00:37,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:00:37,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:00:37,845 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:00:37,845 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe012_pso.opt.i [2019-12-07 15:00:37,880 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer/data/3c90a1c1e/34fd4d84d1ff4bdcb9b94e020d5932b9/FLAG2276ee831 [2019-12-07 15:00:38,332 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:00:38,333 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/sv-benchmarks/c/pthread-wmm/safe012_pso.opt.i [2019-12-07 15:00:38,344 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer/data/3c90a1c1e/34fd4d84d1ff4bdcb9b94e020d5932b9/FLAG2276ee831 [2019-12-07 15:00:38,353 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer/data/3c90a1c1e/34fd4d84d1ff4bdcb9b94e020d5932b9 [2019-12-07 15:00:38,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:00:38,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:00:38,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:00:38,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:00:38,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:00:38,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:00:38" (1/1) ... [2019-12-07 15:00:38,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3482028c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:00:38, skipping insertion in model container [2019-12-07 15:00:38,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:00:38" (1/1) ... [2019-12-07 15:00:38,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:00:38,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:00:38,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:00:38,673 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:00:38,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:00:38,775 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:00:38,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:00:38 WrapperNode [2019-12-07 15:00:38,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:00:38,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:00:38,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:00:38,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:00:38,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:00:38" (1/1) ... [2019-12-07 15:00:38,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:00:38" (1/1) ... [2019-12-07 15:00:38,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:00:38,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:00:38,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:00:38,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:00:38,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:00:38" (1/1) ... [2019-12-07 15:00:38,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:00:38" (1/1) ... [2019-12-07 15:00:38,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:00:38" (1/1) ... [2019-12-07 15:00:38,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:00:38" (1/1) ... [2019-12-07 15:00:38,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:00:38" (1/1) ... [2019-12-07 15:00:38,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:00:38" (1/1) ... [2019-12-07 15:00:38,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:00:38" (1/1) ... [2019-12-07 15:00:38,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:00:38,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:00:38,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:00:38,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:00:38,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:00:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer/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-12-07 15:00:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:00:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 15:00:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:00:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:00:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 15:00:38,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 15:00:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 15:00:38,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 15:00:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 15:00:38,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 15:00:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 15:00:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:00:38,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:00:38,900 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 15:00:39,253 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:00:39,253 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 15:00:39,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:00:39 BoogieIcfgContainer [2019-12-07 15:00:39,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:00:39,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:00:39,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:00:39,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:00:39,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:00:38" (1/3) ... [2019-12-07 15:00:39,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1febdd82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:00:39, skipping insertion in model container [2019-12-07 15:00:39,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:00:38" (2/3) ... [2019-12-07 15:00:39,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1febdd82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:00:39, skipping insertion in model container [2019-12-07 15:00:39,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:00:39" (3/3) ... [2019-12-07 15:00:39,259 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_pso.opt.i [2019-12-07 15:00:39,265 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 15:00:39,265 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:00:39,269 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 15:00:39,270 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 15:00:39,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,294 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,309 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,309 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:00:39,326 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 15:00:39,343 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:00:39,343 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:00:39,343 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:00:39,344 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:00:39,344 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:00:39,344 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:00:39,344 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:00:39,344 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:00:39,355 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-07 15:00:39,357 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 15:00:39,408 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 15:00:39,408 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:00:39,418 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 724 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 15:00:39,432 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 15:00:39,460 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 15:00:39,460 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:00:39,464 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 724 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 15:00:39,480 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 15:00:39,481 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 15:00:42,477 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 15:00:42,612 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64821 [2019-12-07 15:00:42,613 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-07 15:00:42,615 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 89 transitions [2019-12-07 15:00:50,678 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80192 states. [2019-12-07 15:00:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 80192 states. [2019-12-07 15:00:50,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 15:00:50,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:50,685 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 15:00:50,685 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:50,689 INFO L82 PathProgramCache]: Analyzing trace with hash 801165869, now seen corresponding path program 1 times [2019-12-07 15:00:50,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:50,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835098425] [2019-12-07 15:00:50,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:00:50,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835098425] [2019-12-07 15:00:50,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:50,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:00:50,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450520981] [2019-12-07 15:00:50,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:00:50,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:50,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:00:50,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:00:50,851 INFO L87 Difference]: Start difference. First operand 80192 states. Second operand 3 states. [2019-12-07 15:00:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:51,455 INFO L93 Difference]: Finished difference Result 79136 states and 341584 transitions. [2019-12-07 15:00:51,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:00:51,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 15:00:51,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:51,884 INFO L225 Difference]: With dead ends: 79136 [2019-12-07 15:00:51,884 INFO L226 Difference]: Without dead ends: 74600 [2019-12-07 15:00:51,885 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-12-07 15:00:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-07 15:00:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74600. [2019-12-07 15:00:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74600 states. [2019-12-07 15:00:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74600 states to 74600 states and 321550 transitions. [2019-12-07 15:00:55,891 INFO L78 Accepts]: Start accepts. Automaton has 74600 states and 321550 transitions. Word has length 5 [2019-12-07 15:00:55,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:55,892 INFO L462 AbstractCegarLoop]: Abstraction has 74600 states and 321550 transitions. [2019-12-07 15:00:55,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:00:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 74600 states and 321550 transitions. [2019-12-07 15:00:55,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:00:55,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:55,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:00:55,898 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:55,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:55,898 INFO L82 PathProgramCache]: Analyzing trace with hash 144866957, now seen corresponding path program 1 times [2019-12-07 15:00:55,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:00:55,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239414125] [2019-12-07 15:00:55,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:00:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:00:55,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239414125] [2019-12-07 15:00:55,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:55,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:00:55,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971993801] [2019-12-07 15:00:55,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:00:55,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:00:55,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:00:55,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:00:55,966 INFO L87 Difference]: Start difference. First operand 74600 states and 321550 transitions. Second operand 4 states. [2019-12-07 15:00:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:56,605 INFO L93 Difference]: Finished difference Result 114840 states and 473340 transitions. [2019-12-07 15:00:56,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:00:56,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 15:00:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:56,903 INFO L225 Difference]: With dead ends: 114840 [2019-12-07 15:00:56,903 INFO L226 Difference]: Without dead ends: 114749 [2019-12-07 15:00:56,904 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-12-07 15:01:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114749 states. [2019-12-07 15:01:02,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114749 to 106549. [2019-12-07 15:01:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106549 states. [2019-12-07 15:01:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106549 states to 106549 states and 443513 transitions. [2019-12-07 15:01:03,056 INFO L78 Accepts]: Start accepts. Automaton has 106549 states and 443513 transitions. Word has length 13 [2019-12-07 15:01:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:03,057 INFO L462 AbstractCegarLoop]: Abstraction has 106549 states and 443513 transitions. [2019-12-07 15:01:03,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:01:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 106549 states and 443513 transitions. [2019-12-07 15:01:03,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:01:03,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:03,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:01:03,059 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:03,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:03,060 INFO L82 PathProgramCache]: Analyzing trace with hash 483707300, now seen corresponding path program 1 times [2019-12-07 15:01:03,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:03,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42149451] [2019-12-07 15:01:03,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:03,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42149451] [2019-12-07 15:01:03,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:03,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:01:03,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438877988] [2019-12-07 15:01:03,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:01:03,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:03,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:01:03,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:01:03,109 INFO L87 Difference]: Start difference. First operand 106549 states and 443513 transitions. Second operand 4 states. [2019-12-07 15:01:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:04,031 INFO L93 Difference]: Finished difference Result 148763 states and 604775 transitions. [2019-12-07 15:01:04,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:01:04,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 15:01:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:04,385 INFO L225 Difference]: With dead ends: 148763 [2019-12-07 15:01:04,385 INFO L226 Difference]: Without dead ends: 148659 [2019-12-07 15:01:04,385 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-12-07 15:01:07,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148659 states. [2019-12-07 15:01:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148659 to 126910. [2019-12-07 15:01:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126910 states. [2019-12-07 15:01:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126910 states to 126910 states and 524476 transitions. [2019-12-07 15:01:11,575 INFO L78 Accepts]: Start accepts. Automaton has 126910 states and 524476 transitions. Word has length 13 [2019-12-07 15:01:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:11,575 INFO L462 AbstractCegarLoop]: Abstraction has 126910 states and 524476 transitions. [2019-12-07 15:01:11,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:01:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 126910 states and 524476 transitions. [2019-12-07 15:01:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:01:11,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:11,578 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:01:11,578 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:11,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:11,578 INFO L82 PathProgramCache]: Analyzing trace with hash 145051196, now seen corresponding path program 1 times [2019-12-07 15:01:11,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:11,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688644834] [2019-12-07 15:01:11,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:11,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688644834] [2019-12-07 15:01:11,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:11,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:01:11,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331440026] [2019-12-07 15:01:11,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:01:11,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:11,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:01:11,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:01:11,622 INFO L87 Difference]: Start difference. First operand 126910 states and 524476 transitions. Second operand 5 states. [2019-12-07 15:01:12,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:12,490 INFO L93 Difference]: Finished difference Result 172949 states and 700308 transitions. [2019-12-07 15:01:12,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:01:12,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 15:01:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:12,896 INFO L225 Difference]: With dead ends: 172949 [2019-12-07 15:01:12,896 INFO L226 Difference]: Without dead ends: 172813 [2019-12-07 15:01:12,896 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-12-07 15:01:16,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172813 states. [2019-12-07 15:01:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172813 to 134187. [2019-12-07 15:01:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134187 states. [2019-12-07 15:01:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134187 states to 134187 states and 553595 transitions. [2019-12-07 15:01:19,073 INFO L78 Accepts]: Start accepts. Automaton has 134187 states and 553595 transitions. Word has length 14 [2019-12-07 15:01:19,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:19,073 INFO L462 AbstractCegarLoop]: Abstraction has 134187 states and 553595 transitions. [2019-12-07 15:01:19,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:01:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 134187 states and 553595 transitions. [2019-12-07 15:01:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 15:01:19,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:19,088 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:01:19,088 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash -448648622, now seen corresponding path program 1 times [2019-12-07 15:01:19,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:19,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720390119] [2019-12-07 15:01:19,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:19,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720390119] [2019-12-07 15:01:19,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:19,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:01:19,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097266902] [2019-12-07 15:01:19,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:01:19,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:19,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:01:19,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:01:19,139 INFO L87 Difference]: Start difference. First operand 134187 states and 553595 transitions. Second operand 4 states. [2019-12-07 15:01:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:19,282 INFO L93 Difference]: Finished difference Result 38567 states and 134173 transitions. [2019-12-07 15:01:19,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:01:19,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 15:01:19,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:19,333 INFO L225 Difference]: With dead ends: 38567 [2019-12-07 15:01:19,333 INFO L226 Difference]: Without dead ends: 30123 [2019-12-07 15:01:19,334 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-12-07 15:01:19,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30123 states. [2019-12-07 15:01:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30123 to 30122. [2019-12-07 15:01:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30122 states. [2019-12-07 15:01:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30122 states to 30122 states and 100767 transitions. [2019-12-07 15:01:19,837 INFO L78 Accepts]: Start accepts. Automaton has 30122 states and 100767 transitions. Word has length 18 [2019-12-07 15:01:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:19,837 INFO L462 AbstractCegarLoop]: Abstraction has 30122 states and 100767 transitions. [2019-12-07 15:01:19,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:01:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 30122 states and 100767 transitions. [2019-12-07 15:01:19,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:01:19,842 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:19,842 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-12-07 15:01:19,842 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:19,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash 458918585, now seen corresponding path program 1 times [2019-12-07 15:01:19,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:19,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189338484] [2019-12-07 15:01:19,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:19,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189338484] [2019-12-07 15:01:19,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:19,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:01:19,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915951142] [2019-12-07 15:01:19,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:01:19,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:19,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:01:19,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:01:19,891 INFO L87 Difference]: Start difference. First operand 30122 states and 100767 transitions. Second operand 6 states. [2019-12-07 15:01:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:20,754 INFO L93 Difference]: Finished difference Result 46477 states and 151615 transitions. [2019-12-07 15:01:20,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 15:01:20,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 15:01:20,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:20,818 INFO L225 Difference]: With dead ends: 46477 [2019-12-07 15:01:20,818 INFO L226 Difference]: Without dead ends: 46048 [2019-12-07 15:01:20,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:01:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46048 states. [2019-12-07 15:01:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46048 to 30766. [2019-12-07 15:01:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30766 states. [2019-12-07 15:01:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30766 states to 30766 states and 102240 transitions. [2019-12-07 15:01:21,410 INFO L78 Accepts]: Start accepts. Automaton has 30766 states and 102240 transitions. Word has length 22 [2019-12-07 15:01:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:21,410 INFO L462 AbstractCegarLoop]: Abstraction has 30766 states and 102240 transitions. [2019-12-07 15:01:21,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:01:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 30766 states and 102240 transitions. [2019-12-07 15:01:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:01:21,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:21,419 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] [2019-12-07 15:01:21,419 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:21,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:21,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1172052689, now seen corresponding path program 1 times [2019-12-07 15:01:21,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:21,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162977607] [2019-12-07 15:01:21,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:21,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162977607] [2019-12-07 15:01:21,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:21,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:01:21,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727240746] [2019-12-07 15:01:21,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:01:21,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:21,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:01:21,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:01:21,497 INFO L87 Difference]: Start difference. First operand 30766 states and 102240 transitions. Second operand 5 states. [2019-12-07 15:01:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:21,806 INFO L93 Difference]: Finished difference Result 41468 states and 135452 transitions. [2019-12-07 15:01:21,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:01:21,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 15:01:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:21,863 INFO L225 Difference]: With dead ends: 41468 [2019-12-07 15:01:21,863 INFO L226 Difference]: Without dead ends: 41445 [2019-12-07 15:01:21,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:01:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41445 states. [2019-12-07 15:01:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41445 to 34983. [2019-12-07 15:01:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34983 states. [2019-12-07 15:01:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34983 states to 34983 states and 115251 transitions. [2019-12-07 15:01:22,467 INFO L78 Accepts]: Start accepts. Automaton has 34983 states and 115251 transitions. Word has length 25 [2019-12-07 15:01:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:22,467 INFO L462 AbstractCegarLoop]: Abstraction has 34983 states and 115251 transitions. [2019-12-07 15:01:22,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:01:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 34983 states and 115251 transitions. [2019-12-07 15:01:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 15:01:22,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:22,479 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] [2019-12-07 15:01:22,479 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:22,479 INFO L82 PathProgramCache]: Analyzing trace with hash -103947124, now seen corresponding path program 1 times [2019-12-07 15:01:22,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:22,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100877637] [2019-12-07 15:01:22,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:22,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100877637] [2019-12-07 15:01:22,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:22,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:01:22,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20047755] [2019-12-07 15:01:22,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:01:22,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:22,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:01:22,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:01:22,525 INFO L87 Difference]: Start difference. First operand 34983 states and 115251 transitions. Second operand 5 states. [2019-12-07 15:01:22,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:22,597 INFO L93 Difference]: Finished difference Result 14950 states and 45934 transitions. [2019-12-07 15:01:22,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:01:22,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 15:01:22,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:22,612 INFO L225 Difference]: With dead ends: 14950 [2019-12-07 15:01:22,612 INFO L226 Difference]: Without dead ends: 12656 [2019-12-07 15:01:22,613 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-12-07 15:01:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12656 states. [2019-12-07 15:01:22,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12656 to 12364. [2019-12-07 15:01:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12364 states. [2019-12-07 15:01:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12364 states to 12364 states and 37675 transitions. [2019-12-07 15:01:22,777 INFO L78 Accepts]: Start accepts. Automaton has 12364 states and 37675 transitions. Word has length 28 [2019-12-07 15:01:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:22,777 INFO L462 AbstractCegarLoop]: Abstraction has 12364 states and 37675 transitions. [2019-12-07 15:01:22,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:01:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 12364 states and 37675 transitions. [2019-12-07 15:01:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 15:01:22,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:22,791 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] [2019-12-07 15:01:22,791 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:22,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1762476505, now seen corresponding path program 1 times [2019-12-07 15:01:22,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:22,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079968905] [2019-12-07 15:01:22,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:22,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079968905] [2019-12-07 15:01:22,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:22,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:01:22,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499024853] [2019-12-07 15:01:22,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:01:22,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:22,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:01:22,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:01:22,843 INFO L87 Difference]: Start difference. First operand 12364 states and 37675 transitions. Second operand 5 states. [2019-12-07 15:01:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:23,187 INFO L93 Difference]: Finished difference Result 17259 states and 51960 transitions. [2019-12-07 15:01:23,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:01:23,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 15:01:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:23,211 INFO L225 Difference]: With dead ends: 17259 [2019-12-07 15:01:23,211 INFO L226 Difference]: Without dead ends: 17259 [2019-12-07 15:01:23,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:01:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17259 states. [2019-12-07 15:01:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17259 to 14301. [2019-12-07 15:01:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14301 states. [2019-12-07 15:01:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14301 states to 14301 states and 43495 transitions. [2019-12-07 15:01:23,418 INFO L78 Accepts]: Start accepts. Automaton has 14301 states and 43495 transitions. Word has length 39 [2019-12-07 15:01:23,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:23,418 INFO L462 AbstractCegarLoop]: Abstraction has 14301 states and 43495 transitions. [2019-12-07 15:01:23,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:01:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 14301 states and 43495 transitions. [2019-12-07 15:01:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 15:01:23,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:23,435 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] [2019-12-07 15:01:23,435 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:23,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1261997495, now seen corresponding path program 2 times [2019-12-07 15:01:23,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:23,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978969664] [2019-12-07 15:01:23,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:23,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978969664] [2019-12-07 15:01:23,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:23,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:01:23,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992487164] [2019-12-07 15:01:23,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:01:23,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:23,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:01:23,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:01:23,496 INFO L87 Difference]: Start difference. First operand 14301 states and 43495 transitions. Second operand 4 states. [2019-12-07 15:01:23,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:23,536 INFO L93 Difference]: Finished difference Result 14299 states and 43491 transitions. [2019-12-07 15:01:23,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:01:23,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-07 15:01:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:23,551 INFO L225 Difference]: With dead ends: 14299 [2019-12-07 15:01:23,551 INFO L226 Difference]: Without dead ends: 14299 [2019-12-07 15:01:23,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-12-07 15:01:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14299 states. [2019-12-07 15:01:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14299 to 14299. [2019-12-07 15:01:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14299 states. [2019-12-07 15:01:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14299 states to 14299 states and 43491 transitions. [2019-12-07 15:01:23,764 INFO L78 Accepts]: Start accepts. Automaton has 14299 states and 43491 transitions. Word has length 39 [2019-12-07 15:01:23,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:23,764 INFO L462 AbstractCegarLoop]: Abstraction has 14299 states and 43491 transitions. [2019-12-07 15:01:23,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:01:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 14299 states and 43491 transitions. [2019-12-07 15:01:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 15:01:23,786 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:23,786 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] [2019-12-07 15:01:23,786 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:23,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:23,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1415290960, now seen corresponding path program 1 times [2019-12-07 15:01:23,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:23,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577400357] [2019-12-07 15:01:23,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:23,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577400357] [2019-12-07 15:01:23,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:23,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:01:23,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744895786] [2019-12-07 15:01:23,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:01:23,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:23,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:01:23,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:01:23,851 INFO L87 Difference]: Start difference. First operand 14299 states and 43491 transitions. Second operand 7 states. [2019-12-07 15:01:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:24,995 INFO L93 Difference]: Finished difference Result 19134 states and 56592 transitions. [2019-12-07 15:01:24,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 15:01:24,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-07 15:01:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:25,024 INFO L225 Difference]: With dead ends: 19134 [2019-12-07 15:01:25,024 INFO L226 Difference]: Without dead ends: 19130 [2019-12-07 15:01:25,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-07 15:01:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19130 states. [2019-12-07 15:01:25,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19130 to 14227. [2019-12-07 15:01:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14227 states. [2019-12-07 15:01:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14227 states to 14227 states and 43234 transitions. [2019-12-07 15:01:25,243 INFO L78 Accepts]: Start accepts. Automaton has 14227 states and 43234 transitions. Word has length 40 [2019-12-07 15:01:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:25,243 INFO L462 AbstractCegarLoop]: Abstraction has 14227 states and 43234 transitions. [2019-12-07 15:01:25,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:01:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14227 states and 43234 transitions. [2019-12-07 15:01:25,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 15:01:25,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:25,255 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] [2019-12-07 15:01:25,255 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:25,256 INFO L82 PathProgramCache]: Analyzing trace with hash 659641747, now seen corresponding path program 1 times [2019-12-07 15:01:25,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:25,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664945287] [2019-12-07 15:01:25,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:25,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664945287] [2019-12-07 15:01:25,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:25,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:01:25,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145494894] [2019-12-07 15:01:25,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:01:25,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:25,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:01:25,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:01:25,298 INFO L87 Difference]: Start difference. First operand 14227 states and 43234 transitions. Second operand 3 states. [2019-12-07 15:01:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:25,338 INFO L93 Difference]: Finished difference Result 14146 states and 42952 transitions. [2019-12-07 15:01:25,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:01:25,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 15:01:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:25,354 INFO L225 Difference]: With dead ends: 14146 [2019-12-07 15:01:25,354 INFO L226 Difference]: Without dead ends: 14146 [2019-12-07 15:01:25,354 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-12-07 15:01:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14146 states. [2019-12-07 15:01:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14146 to 13143. [2019-12-07 15:01:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13143 states. [2019-12-07 15:01:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13143 states to 13143 states and 40108 transitions. [2019-12-07 15:01:25,530 INFO L78 Accepts]: Start accepts. Automaton has 13143 states and 40108 transitions. Word has length 40 [2019-12-07 15:01:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:25,531 INFO L462 AbstractCegarLoop]: Abstraction has 13143 states and 40108 transitions. [2019-12-07 15:01:25,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:01:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 13143 states and 40108 transitions. [2019-12-07 15:01:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 15:01:25,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:25,542 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] [2019-12-07 15:01:25,542 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:25,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:25,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1207116439, now seen corresponding path program 1 times [2019-12-07 15:01:25,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:25,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445834644] [2019-12-07 15:01:25,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:25,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445834644] [2019-12-07 15:01:25,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:25,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 15:01:25,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825120287] [2019-12-07 15:01:25,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 15:01:25,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:25,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 15:01:25,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:01:25,748 INFO L87 Difference]: Start difference. First operand 13143 states and 40108 transitions. Second operand 11 states. [2019-12-07 15:01:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:26,409 INFO L93 Difference]: Finished difference Result 28265 states and 85368 transitions. [2019-12-07 15:01:26,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 15:01:26,409 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-12-07 15:01:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:26,422 INFO L225 Difference]: With dead ends: 28265 [2019-12-07 15:01:26,422 INFO L226 Difference]: Without dead ends: 11752 [2019-12-07 15:01:26,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-12-07 15:01:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11752 states. [2019-12-07 15:01:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11752 to 11646. [2019-12-07 15:01:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11646 states. [2019-12-07 15:01:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11646 states to 11646 states and 35308 transitions. [2019-12-07 15:01:26,570 INFO L78 Accepts]: Start accepts. Automaton has 11646 states and 35308 transitions. Word has length 41 [2019-12-07 15:01:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:26,570 INFO L462 AbstractCegarLoop]: Abstraction has 11646 states and 35308 transitions. [2019-12-07 15:01:26,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 15:01:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 11646 states and 35308 transitions. [2019-12-07 15:01:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 15:01:26,579 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:26,579 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] [2019-12-07 15:01:26,579 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:26,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:26,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1495792125, now seen corresponding path program 2 times [2019-12-07 15:01:26,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:26,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499032983] [2019-12-07 15:01:26,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:26,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499032983] [2019-12-07 15:01:26,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:26,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:01:26,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390722203] [2019-12-07 15:01:26,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:01:26,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:26,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:01:26,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:01:26,612 INFO L87 Difference]: Start difference. First operand 11646 states and 35308 transitions. Second operand 3 states. [2019-12-07 15:01:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:26,639 INFO L93 Difference]: Finished difference Result 8797 states and 26269 transitions. [2019-12-07 15:01:26,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:01:26,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 15:01:26,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:26,649 INFO L225 Difference]: With dead ends: 8797 [2019-12-07 15:01:26,649 INFO L226 Difference]: Without dead ends: 8797 [2019-12-07 15:01:26,649 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-12-07 15:01:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8797 states. [2019-12-07 15:01:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8797 to 8723. [2019-12-07 15:01:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8723 states. [2019-12-07 15:01:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8723 states to 8723 states and 26064 transitions. [2019-12-07 15:01:26,762 INFO L78 Accepts]: Start accepts. Automaton has 8723 states and 26064 transitions. Word has length 41 [2019-12-07 15:01:26,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:26,762 INFO L462 AbstractCegarLoop]: Abstraction has 8723 states and 26064 transitions. [2019-12-07 15:01:26,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:01:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 8723 states and 26064 transitions. [2019-12-07 15:01:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 15:01:26,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:26,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] [2019-12-07 15:01:26,769 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:26,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash -598466109, now seen corresponding path program 1 times [2019-12-07 15:01:26,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:26,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99147728] [2019-12-07 15:01:26,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:26,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99147728] [2019-12-07 15:01:26,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:26,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:01:26,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066757286] [2019-12-07 15:01:26,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:01:26,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:26,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:01:26,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:01:26,819 INFO L87 Difference]: Start difference. First operand 8723 states and 26064 transitions. Second operand 6 states. [2019-12-07 15:01:26,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:26,879 INFO L93 Difference]: Finished difference Result 7581 states and 23337 transitions. [2019-12-07 15:01:26,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:01:26,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 15:01:26,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:26,888 INFO L225 Difference]: With dead ends: 7581 [2019-12-07 15:01:26,888 INFO L226 Difference]: Without dead ends: 7475 [2019-12-07 15:01:26,888 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-12-07 15:01:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7475 states. [2019-12-07 15:01:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7475 to 7391. [2019-12-07 15:01:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7391 states. [2019-12-07 15:01:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 22863 transitions. [2019-12-07 15:01:26,986 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 22863 transitions. Word has length 42 [2019-12-07 15:01:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:26,987 INFO L462 AbstractCegarLoop]: Abstraction has 7391 states and 22863 transitions. [2019-12-07 15:01:26,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:01:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 22863 transitions. [2019-12-07 15:01:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:01:26,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:26,993 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:01:26,993 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:26,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1916857338, now seen corresponding path program 1 times [2019-12-07 15:01:26,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:26,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303368323] [2019-12-07 15:01:26,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:27,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303368323] [2019-12-07 15:01:27,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:27,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:01:27,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323276606] [2019-12-07 15:01:27,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:01:27,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:27,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:01:27,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:01:27,024 INFO L87 Difference]: Start difference. First operand 7391 states and 22863 transitions. Second operand 3 states. [2019-12-07 15:01:27,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:27,067 INFO L93 Difference]: Finished difference Result 10175 states and 30901 transitions. [2019-12-07 15:01:27,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:01:27,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 15:01:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:27,078 INFO L225 Difference]: With dead ends: 10175 [2019-12-07 15:01:27,078 INFO L226 Difference]: Without dead ends: 10175 [2019-12-07 15:01:27,079 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-12-07 15:01:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10175 states. [2019-12-07 15:01:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10175 to 7795. [2019-12-07 15:01:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7795 states. [2019-12-07 15:01:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7795 states to 7795 states and 24155 transitions. [2019-12-07 15:01:27,193 INFO L78 Accepts]: Start accepts. Automaton has 7795 states and 24155 transitions. Word has length 56 [2019-12-07 15:01:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:27,193 INFO L462 AbstractCegarLoop]: Abstraction has 7795 states and 24155 transitions. [2019-12-07 15:01:27,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:01:27,193 INFO L276 IsEmpty]: Start isEmpty. Operand 7795 states and 24155 transitions. [2019-12-07 15:01:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:01:27,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:27,199 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:01:27,199 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:27,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:27,199 INFO L82 PathProgramCache]: Analyzing trace with hash -261820410, now seen corresponding path program 1 times [2019-12-07 15:01:27,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:27,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018939370] [2019-12-07 15:01:27,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:27,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018939370] [2019-12-07 15:01:27,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:27,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 15:01:27,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970916928] [2019-12-07 15:01:27,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 15:01:27,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:27,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 15:01:27,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-07 15:01:27,459 INFO L87 Difference]: Start difference. First operand 7795 states and 24155 transitions. Second operand 14 states. [2019-12-07 15:01:28,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:28,685 INFO L93 Difference]: Finished difference Result 14033 states and 42864 transitions. [2019-12-07 15:01:28,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 15:01:28,686 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-07 15:01:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:28,702 INFO L225 Difference]: With dead ends: 14033 [2019-12-07 15:01:28,702 INFO L226 Difference]: Without dead ends: 12477 [2019-12-07 15:01:28,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=298, Invalid=1682, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 15:01:28,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12477 states. [2019-12-07 15:01:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12477 to 9674. [2019-12-07 15:01:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9674 states. [2019-12-07 15:01:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9674 states to 9674 states and 29839 transitions. [2019-12-07 15:01:28,845 INFO L78 Accepts]: Start accepts. Automaton has 9674 states and 29839 transitions. Word has length 56 [2019-12-07 15:01:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:28,845 INFO L462 AbstractCegarLoop]: Abstraction has 9674 states and 29839 transitions. [2019-12-07 15:01:28,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 15:01:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 9674 states and 29839 transitions. [2019-12-07 15:01:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:01:28,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:28,853 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:01:28,853 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2026686606, now seen corresponding path program 2 times [2019-12-07 15:01:28,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:28,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722719514] [2019-12-07 15:01:28,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:28,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722719514] [2019-12-07 15:01:28,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:28,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 15:01:28,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318043603] [2019-12-07 15:01:28,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 15:01:28,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:28,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 15:01:28,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:01:28,980 INFO L87 Difference]: Start difference. First operand 9674 states and 29839 transitions. Second operand 11 states. [2019-12-07 15:01:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:29,827 INFO L93 Difference]: Finished difference Result 25296 states and 78345 transitions. [2019-12-07 15:01:29,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 15:01:29,827 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 15:01:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:29,844 INFO L225 Difference]: With dead ends: 25296 [2019-12-07 15:01:29,844 INFO L226 Difference]: Without dead ends: 16376 [2019-12-07 15:01:29,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 15:01:29,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16376 states. [2019-12-07 15:01:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16376 to 9785. [2019-12-07 15:01:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9785 states. [2019-12-07 15:01:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9785 states to 9785 states and 30031 transitions. [2019-12-07 15:01:30,016 INFO L78 Accepts]: Start accepts. Automaton has 9785 states and 30031 transitions. Word has length 56 [2019-12-07 15:01:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:30,016 INFO L462 AbstractCegarLoop]: Abstraction has 9785 states and 30031 transitions. [2019-12-07 15:01:30,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 15:01:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 9785 states and 30031 transitions. [2019-12-07 15:01:30,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:01:30,024 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:30,024 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:01:30,024 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:30,024 INFO L82 PathProgramCache]: Analyzing trace with hash -899860532, now seen corresponding path program 3 times [2019-12-07 15:01:30,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:30,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964302500] [2019-12-07 15:01:30,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:01:30,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964302500] [2019-12-07 15:01:30,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:30,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 15:01:30,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802772771] [2019-12-07 15:01:30,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 15:01:30,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:01:30,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 15:01:30,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:01:30,174 INFO L87 Difference]: Start difference. First operand 9785 states and 30031 transitions. Second operand 12 states. [2019-12-07 15:01:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:30,655 INFO L93 Difference]: Finished difference Result 16272 states and 49324 transitions. [2019-12-07 15:01:30,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 15:01:30,655 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-07 15:01:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:30,672 INFO L225 Difference]: With dead ends: 16272 [2019-12-07 15:01:30,672 INFO L226 Difference]: Without dead ends: 15620 [2019-12-07 15:01:30,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2019-12-07 15:01:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15620 states. [2019-12-07 15:01:30,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15620 to 9589. [2019-12-07 15:01:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9589 states. [2019-12-07 15:01:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9589 states to 9589 states and 29465 transitions. [2019-12-07 15:01:30,845 INFO L78 Accepts]: Start accepts. Automaton has 9589 states and 29465 transitions. Word has length 56 [2019-12-07 15:01:30,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:30,845 INFO L462 AbstractCegarLoop]: Abstraction has 9589 states and 29465 transitions. [2019-12-07 15:01:30,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 15:01:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 9589 states and 29465 transitions. [2019-12-07 15:01:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:01:30,853 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:30,853 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:01:30,853 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:30,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:30,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1827744688, now seen corresponding path program 4 times [2019-12-07 15:01:30,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:01:30,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379276027] [2019-12-07 15:01:30,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:01:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:01:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:01:30,923 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:01:30,923 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:01:30,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~x$r_buff1_thd1~0_405 0) (= v_~z~0_42 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2058~0.base_25|) 0) (= v_~y~0_203 0) (= 0 v_~x$w_buff1~0_314) (= 0 v_~x$r_buff0_thd3~0_141) (= v_~x$flush_delayed~0_58 0) (= v_~__unbuffered_p0_EBX~0_60 0) (= v_~x$mem_tmp~0_35 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2058~0.base_25| 4)) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$w_buff0_used~0_913) (= v_~x$r_buff0_thd0~0_157 0) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1_used~0_606) (= 0 v_~weak$$choice0~0_33) (= 0 v_~x$r_buff0_thd2~0_302) (= 0 v_~x$r_buff1_thd2~0_251) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2058~0.base_25|) (= v_~x$r_buff1_thd0~0_275 0) (= 0 v_~x$w_buff0~0_388) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2058~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2058~0.base_25|) |v_ULTIMATE.start_main_~#t2058~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_254) (= |v_ULTIMATE.start_main_~#t2058~0.offset_19| 0) (= v_~main$tmp_guard0~0_48 0) (= 0 v_~x~0_230) (= v_~weak$$choice2~0_176 0) (= v_~x$r_buff0_thd1~0_365 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2058~0.base_25| 1)) (= 0 v_~__unbuffered_p0_EAX~0_54))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_405, ULTIMATE.start_main_~#t2059~0.offset=|v_ULTIMATE.start_main_~#t2059~0.offset_19|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_141, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_251, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_33, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_230, ULTIMATE.start_main_~#t2058~0.base=|v_ULTIMATE.start_main_~#t2058~0.base_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_365, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_35, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_59|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2058~0.offset=|v_ULTIMATE.start_main_~#t2058~0.offset_19|, ~y~0=v_~y~0_203, ULTIMATE.start_main_~#t2060~0.offset=|v_ULTIMATE.start_main_~#t2060~0.offset_14|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_21|, ULTIMATE.start_main_~#t2059~0.base=|v_ULTIMATE.start_main_~#t2059~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_~#t2060~0.base=|v_ULTIMATE.start_main_~#t2060~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t2059~0.offset, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2058~0.base, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2058~0.offset, ~y~0, ULTIMATE.start_main_~#t2060~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2059~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2060~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 15:01:30,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2059~0.base_10| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2059~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t2059~0.base_10|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2059~0.base_10|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2059~0.base_10| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2059~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2059~0.base_10|) |v_ULTIMATE.start_main_~#t2059~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t2059~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t2059~0.base=|v_ULTIMATE.start_main_~#t2059~0.base_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2059~0.offset=|v_ULTIMATE.start_main_~#t2059~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2059~0.base, #length, ULTIMATE.start_main_~#t2059~0.offset] because there is no mapped edge [2019-12-07 15:01:30,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2060~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2060~0.base_11|) |v_ULTIMATE.start_main_~#t2060~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2060~0.base_11| 0)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2060~0.base_11| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2060~0.base_11|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2060~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2060~0.offset_10|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2060~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2060~0.base=|v_ULTIMATE.start_main_~#t2060~0.base_11|, ULTIMATE.start_main_~#t2060~0.offset=|v_ULTIMATE.start_main_~#t2060~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2060~0.base, ULTIMATE.start_main_~#t2060~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 15:01:30,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff1_used~0_56 v_~x$w_buff0_used~0_106) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_15) (= 1 v_~x$w_buff0_used~0_105) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_7|) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_56 256))) (not (= (mod v_~x$w_buff0_used~0_105 256) 0)))) 1 0)) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 15:01:30,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In573747497 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In573747497 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out573747497| ~x$w_buff1~0_In573747497) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out573747497| ~x~0_In573747497) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In573747497, ~x$w_buff1_used~0=~x$w_buff1_used~0_In573747497, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In573747497, ~x~0=~x~0_In573747497} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out573747497|, ~x$w_buff1~0=~x$w_buff1~0_In573747497, ~x$w_buff1_used~0=~x$w_buff1_used~0_In573747497, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In573747497, ~x~0=~x~0_In573747497} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 15:01:30,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 15:01:30,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1921084419 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1921084419 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1921084419|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1921084419 |P2Thread1of1ForFork1_#t~ite34_Out1921084419|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1921084419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1921084419} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1921084419|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1921084419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1921084419} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 15:01:30,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2129034695 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2129034695 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out2129034695| ~x$w_buff0_used~0_In2129034695)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out2129034695| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2129034695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129034695} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2129034695, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out2129034695|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129034695} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 15:01:30,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-646028090 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-646028090 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-646028090 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-646028090 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-646028090|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-646028090| ~x$w_buff1_used~0_In-646028090) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-646028090, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-646028090, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-646028090, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-646028090} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-646028090, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-646028090, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-646028090, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-646028090|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-646028090} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 15:01:30,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1837783620 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out1837783620| ~x$w_buff0~0_In1837783620) (= |P0Thread1of1ForFork2_#t~ite8_Out1837783620| |P0Thread1of1ForFork2_#t~ite9_Out1837783620|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1837783620 256) 0))) (or (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1837783620 256))) (= (mod ~x$w_buff0_used~0_In1837783620 256) 0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In1837783620 256))))) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite8_In1837783620| |P0Thread1of1ForFork2_#t~ite8_Out1837783620|) (not .cse1) (= ~x$w_buff0~0_In1837783620 |P0Thread1of1ForFork2_#t~ite9_Out1837783620|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1837783620, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1837783620, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In1837783620|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1837783620, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1837783620, ~weak$$choice2~0=~weak$$choice2~0_In1837783620, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1837783620} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1837783620, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1837783620, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1837783620|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1837783620, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1837783620|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1837783620, ~weak$$choice2~0=~weak$$choice2~0_In1837783620, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1837783620} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 15:01:30,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-503737183 256)))) (or (and (= ~x$w_buff0_used~0_In-503737183 |P0Thread1of1ForFork2_#t~ite15_Out-503737183|) (= |P0Thread1of1ForFork2_#t~ite14_In-503737183| |P0Thread1of1ForFork2_#t~ite14_Out-503737183|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite14_Out-503737183| |P0Thread1of1ForFork2_#t~ite15_Out-503737183|) (= ~x$w_buff0_used~0_In-503737183 |P0Thread1of1ForFork2_#t~ite14_Out-503737183|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-503737183 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-503737183 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-503737183 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-503737183 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-503737183, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-503737183, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-503737183, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-503737183|, ~weak$$choice2~0=~weak$$choice2~0_In-503737183, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-503737183} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-503737183, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-503737183, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-503737183|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-503737183, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-503737183|, ~weak$$choice2~0=~weak$$choice2~0_In-503737183, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-503737183} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 15:01:30,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1960142224 256) 0))) (or (and (= ~x$w_buff1_used~0_In1960142224 |P0Thread1of1ForFork2_#t~ite17_Out1960142224|) (= |P0Thread1of1ForFork2_#t~ite17_Out1960142224| |P0Thread1of1ForFork2_#t~ite18_Out1960142224|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1960142224 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In1960142224 256)) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1960142224 256))) (= 0 (mod ~x$w_buff0_used~0_In1960142224 256))))) (and (= |P0Thread1of1ForFork2_#t~ite17_In1960142224| |P0Thread1of1ForFork2_#t~ite17_Out1960142224|) (= ~x$w_buff1_used~0_In1960142224 |P0Thread1of1ForFork2_#t~ite18_Out1960142224|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1960142224, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1960142224|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1960142224, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1960142224, ~weak$$choice2~0=~weak$$choice2~0_In1960142224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1960142224} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1960142224, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1960142224|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1960142224|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1960142224, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1960142224, ~weak$$choice2~0=~weak$$choice2~0_In1960142224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1960142224} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 15:01:30,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_112 v_~x$r_buff0_thd1~0_111) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_15|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 15:01:30,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1646599897 256) 0))) (or (and (= ~x$r_buff1_thd1~0_In-1646599897 |P0Thread1of1ForFork2_#t~ite23_Out-1646599897|) (= |P0Thread1of1ForFork2_#t~ite24_Out-1646599897| |P0Thread1of1ForFork2_#t~ite23_Out-1646599897|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1646599897 256)))) (or (= (mod ~x$w_buff0_used~0_In-1646599897 256) 0) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In-1646599897 256) 0)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1646599897 256))))) .cse1) (and (= ~x$r_buff1_thd1~0_In-1646599897 |P0Thread1of1ForFork2_#t~ite24_Out-1646599897|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite23_In-1646599897| |P0Thread1of1ForFork2_#t~ite23_Out-1646599897|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1646599897, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1646599897, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1646599897, ~weak$$choice2~0=~weak$$choice2~0_In-1646599897, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1646599897|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1646599897} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1646599897, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1646599897, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1646599897, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1646599897|, ~weak$$choice2~0=~weak$$choice2~0_In-1646599897, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1646599897|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1646599897} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 15:01:30,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In540860393 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In540860393 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In540860393 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In540860393 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out540860393|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In540860393 |P2Thread1of1ForFork1_#t~ite35_Out540860393|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In540860393, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In540860393, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In540860393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In540860393} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out540860393|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In540860393, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In540860393, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In540860393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In540860393} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 15:01:30,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1422999399 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1422999399 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1422999399| ~x$r_buff0_thd3~0_In-1422999399) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-1422999399| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1422999399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1422999399} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1422999399|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1422999399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1422999399} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 15:01:30,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1282439239 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In1282439239 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1282439239 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1282439239 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out1282439239| ~x$r_buff1_thd3~0_In1282439239)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1282439239| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1282439239, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1282439239, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1282439239, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1282439239} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1282439239|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1282439239, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1282439239, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1282439239, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1282439239} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 15:01:30,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= v_~x$r_buff1_thd3~0_52 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_53 1) v_~__unbuffered_cnt~0_52) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 15:01:30,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In885618846 ~x$r_buff0_thd2~0_Out885618846)) (.cse0 (= (mod ~x$w_buff0_used~0_In885618846 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In885618846 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out885618846)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In885618846, ~x$w_buff0_used~0=~x$w_buff0_used~0_In885618846} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out885618846|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out885618846, ~x$w_buff0_used~0=~x$w_buff0_used~0_In885618846} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 15:01:30,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1324798285 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1324798285 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1324798285 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1324798285 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1324798285| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-1324798285| ~x$r_buff1_thd2~0_In-1324798285)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1324798285, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1324798285, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1324798285, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1324798285} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1324798285|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1324798285, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1324798285, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1324798285, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1324798285} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 15:01:30,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork0_#t~ite31_28|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 15:01:30,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 15:01:30,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_27 256) 0) (= (mod v_~x$w_buff0_used~0_180 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 15:01:30,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In241933967 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In241933967 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out241933967| ~x$w_buff1~0_In241933967) (not .cse1)) (and (= ~x~0_In241933967 |ULTIMATE.start_main_#t~ite41_Out241933967|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In241933967, ~x$w_buff1_used~0=~x$w_buff1_used~0_In241933967, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In241933967, ~x~0=~x~0_In241933967} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out241933967|, ~x$w_buff1~0=~x$w_buff1~0_In241933967, ~x$w_buff1_used~0=~x$w_buff1_used~0_In241933967, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In241933967, ~x~0=~x~0_In241933967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 15:01:30,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_26 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 15:01:30,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1816168862 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1816168862 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1816168862| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1816168862 |ULTIMATE.start_main_#t~ite43_Out-1816168862|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1816168862, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1816168862} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1816168862, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1816168862|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1816168862} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 15:01:30,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In1000501687 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1000501687 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1000501687 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1000501687 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1000501687 |ULTIMATE.start_main_#t~ite44_Out1000501687|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite44_Out1000501687|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1000501687, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1000501687, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1000501687, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1000501687} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1000501687, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1000501687, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1000501687, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1000501687|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1000501687} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 15:01:30,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2022107037 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In2022107037 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out2022107037| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out2022107037| ~x$r_buff0_thd0~0_In2022107037)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2022107037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2022107037} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2022107037, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2022107037|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2022107037} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 15:01:30,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1326652511 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1326652511 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1326652511 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1326652511 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out1326652511| ~x$r_buff1_thd0~0_In1326652511)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out1326652511| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1326652511, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1326652511, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1326652511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1326652511} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1326652511, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1326652511|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1326652511, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1326652511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1326652511} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 15:01:30,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite46_48|) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_48 0) (= 1 v_~__unbuffered_p2_EAX~0_27) (= 1 v_~__unbuffered_p0_EAX~0_42))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:01:30,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:01:30 BasicIcfg [2019-12-07 15:01:30,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:01:30,994 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:01:30,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:01:30,995 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:01:30,995 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:00:39" (3/4) ... [2019-12-07 15:01:30,997 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:01:30,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~x$r_buff1_thd1~0_405 0) (= v_~z~0_42 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2058~0.base_25|) 0) (= v_~y~0_203 0) (= 0 v_~x$w_buff1~0_314) (= 0 v_~x$r_buff0_thd3~0_141) (= v_~x$flush_delayed~0_58 0) (= v_~__unbuffered_p0_EBX~0_60 0) (= v_~x$mem_tmp~0_35 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2058~0.base_25| 4)) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$w_buff0_used~0_913) (= v_~x$r_buff0_thd0~0_157 0) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1_used~0_606) (= 0 v_~weak$$choice0~0_33) (= 0 v_~x$r_buff0_thd2~0_302) (= 0 v_~x$r_buff1_thd2~0_251) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2058~0.base_25|) (= v_~x$r_buff1_thd0~0_275 0) (= 0 v_~x$w_buff0~0_388) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2058~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2058~0.base_25|) |v_ULTIMATE.start_main_~#t2058~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_254) (= |v_ULTIMATE.start_main_~#t2058~0.offset_19| 0) (= v_~main$tmp_guard0~0_48 0) (= 0 v_~x~0_230) (= v_~weak$$choice2~0_176 0) (= v_~x$r_buff0_thd1~0_365 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2058~0.base_25| 1)) (= 0 v_~__unbuffered_p0_EAX~0_54))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_405, ULTIMATE.start_main_~#t2059~0.offset=|v_ULTIMATE.start_main_~#t2059~0.offset_19|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_141, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_251, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_33, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_230, ULTIMATE.start_main_~#t2058~0.base=|v_ULTIMATE.start_main_~#t2058~0.base_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_365, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_35, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_59|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2058~0.offset=|v_ULTIMATE.start_main_~#t2058~0.offset_19|, ~y~0=v_~y~0_203, ULTIMATE.start_main_~#t2060~0.offset=|v_ULTIMATE.start_main_~#t2060~0.offset_14|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_21|, ULTIMATE.start_main_~#t2059~0.base=|v_ULTIMATE.start_main_~#t2059~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_~#t2060~0.base=|v_ULTIMATE.start_main_~#t2060~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t2059~0.offset, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2058~0.base, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2058~0.offset, ~y~0, ULTIMATE.start_main_~#t2060~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2059~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2060~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 15:01:30,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2059~0.base_10| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2059~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t2059~0.base_10|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2059~0.base_10|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2059~0.base_10| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2059~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2059~0.base_10|) |v_ULTIMATE.start_main_~#t2059~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t2059~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t2059~0.base=|v_ULTIMATE.start_main_~#t2059~0.base_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2059~0.offset=|v_ULTIMATE.start_main_~#t2059~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2059~0.base, #length, ULTIMATE.start_main_~#t2059~0.offset] because there is no mapped edge [2019-12-07 15:01:30,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2060~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2060~0.base_11|) |v_ULTIMATE.start_main_~#t2060~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2060~0.base_11| 0)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2060~0.base_11| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2060~0.base_11|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2060~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2060~0.offset_10|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2060~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2060~0.base=|v_ULTIMATE.start_main_~#t2060~0.base_11|, ULTIMATE.start_main_~#t2060~0.offset=|v_ULTIMATE.start_main_~#t2060~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2060~0.base, ULTIMATE.start_main_~#t2060~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 15:01:30,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff1_used~0_56 v_~x$w_buff0_used~0_106) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_15) (= 1 v_~x$w_buff0_used~0_105) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_7|) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_56 256))) (not (= (mod v_~x$w_buff0_used~0_105 256) 0)))) 1 0)) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 15:01:31,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In573747497 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In573747497 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out573747497| ~x$w_buff1~0_In573747497) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out573747497| ~x~0_In573747497) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In573747497, ~x$w_buff1_used~0=~x$w_buff1_used~0_In573747497, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In573747497, ~x~0=~x~0_In573747497} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out573747497|, ~x$w_buff1~0=~x$w_buff1~0_In573747497, ~x$w_buff1_used~0=~x$w_buff1_used~0_In573747497, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In573747497, ~x~0=~x~0_In573747497} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 15:01:31,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 15:01:31,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1921084419 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1921084419 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1921084419|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1921084419 |P2Thread1of1ForFork1_#t~ite34_Out1921084419|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1921084419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1921084419} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1921084419|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1921084419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1921084419} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 15:01:31,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2129034695 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2129034695 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out2129034695| ~x$w_buff0_used~0_In2129034695)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out2129034695| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2129034695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129034695} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2129034695, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out2129034695|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129034695} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 15:01:31,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-646028090 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-646028090 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-646028090 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-646028090 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-646028090|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-646028090| ~x$w_buff1_used~0_In-646028090) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-646028090, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-646028090, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-646028090, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-646028090} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-646028090, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-646028090, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-646028090, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-646028090|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-646028090} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 15:01:31,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1837783620 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out1837783620| ~x$w_buff0~0_In1837783620) (= |P0Thread1of1ForFork2_#t~ite8_Out1837783620| |P0Thread1of1ForFork2_#t~ite9_Out1837783620|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1837783620 256) 0))) (or (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1837783620 256))) (= (mod ~x$w_buff0_used~0_In1837783620 256) 0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In1837783620 256))))) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite8_In1837783620| |P0Thread1of1ForFork2_#t~ite8_Out1837783620|) (not .cse1) (= ~x$w_buff0~0_In1837783620 |P0Thread1of1ForFork2_#t~ite9_Out1837783620|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1837783620, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1837783620, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In1837783620|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1837783620, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1837783620, ~weak$$choice2~0=~weak$$choice2~0_In1837783620, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1837783620} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1837783620, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1837783620, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1837783620|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1837783620, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1837783620|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1837783620, ~weak$$choice2~0=~weak$$choice2~0_In1837783620, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1837783620} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 15:01:31,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-503737183 256)))) (or (and (= ~x$w_buff0_used~0_In-503737183 |P0Thread1of1ForFork2_#t~ite15_Out-503737183|) (= |P0Thread1of1ForFork2_#t~ite14_In-503737183| |P0Thread1of1ForFork2_#t~ite14_Out-503737183|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite14_Out-503737183| |P0Thread1of1ForFork2_#t~ite15_Out-503737183|) (= ~x$w_buff0_used~0_In-503737183 |P0Thread1of1ForFork2_#t~ite14_Out-503737183|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-503737183 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-503737183 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-503737183 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-503737183 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-503737183, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-503737183, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-503737183, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-503737183|, ~weak$$choice2~0=~weak$$choice2~0_In-503737183, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-503737183} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-503737183, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-503737183, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-503737183|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-503737183, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-503737183|, ~weak$$choice2~0=~weak$$choice2~0_In-503737183, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-503737183} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 15:01:31,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1960142224 256) 0))) (or (and (= ~x$w_buff1_used~0_In1960142224 |P0Thread1of1ForFork2_#t~ite17_Out1960142224|) (= |P0Thread1of1ForFork2_#t~ite17_Out1960142224| |P0Thread1of1ForFork2_#t~ite18_Out1960142224|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1960142224 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In1960142224 256)) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1960142224 256))) (= 0 (mod ~x$w_buff0_used~0_In1960142224 256))))) (and (= |P0Thread1of1ForFork2_#t~ite17_In1960142224| |P0Thread1of1ForFork2_#t~ite17_Out1960142224|) (= ~x$w_buff1_used~0_In1960142224 |P0Thread1of1ForFork2_#t~ite18_Out1960142224|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1960142224, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1960142224|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1960142224, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1960142224, ~weak$$choice2~0=~weak$$choice2~0_In1960142224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1960142224} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1960142224, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1960142224|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1960142224|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1960142224, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1960142224, ~weak$$choice2~0=~weak$$choice2~0_In1960142224, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1960142224} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 15:01:31,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_112 v_~x$r_buff0_thd1~0_111) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_15|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 15:01:31,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1646599897 256) 0))) (or (and (= ~x$r_buff1_thd1~0_In-1646599897 |P0Thread1of1ForFork2_#t~ite23_Out-1646599897|) (= |P0Thread1of1ForFork2_#t~ite24_Out-1646599897| |P0Thread1of1ForFork2_#t~ite23_Out-1646599897|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1646599897 256)))) (or (= (mod ~x$w_buff0_used~0_In-1646599897 256) 0) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In-1646599897 256) 0)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1646599897 256))))) .cse1) (and (= ~x$r_buff1_thd1~0_In-1646599897 |P0Thread1of1ForFork2_#t~ite24_Out-1646599897|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite23_In-1646599897| |P0Thread1of1ForFork2_#t~ite23_Out-1646599897|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1646599897, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1646599897, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1646599897, ~weak$$choice2~0=~weak$$choice2~0_In-1646599897, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1646599897|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1646599897} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1646599897, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1646599897, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1646599897, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1646599897|, ~weak$$choice2~0=~weak$$choice2~0_In-1646599897, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1646599897|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1646599897} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 15:01:31,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In540860393 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In540860393 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In540860393 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In540860393 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out540860393|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In540860393 |P2Thread1of1ForFork1_#t~ite35_Out540860393|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In540860393, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In540860393, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In540860393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In540860393} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out540860393|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In540860393, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In540860393, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In540860393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In540860393} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 15:01:31,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1422999399 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1422999399 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1422999399| ~x$r_buff0_thd3~0_In-1422999399) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-1422999399| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1422999399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1422999399} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1422999399|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1422999399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1422999399} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 15:01:31,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1282439239 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In1282439239 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1282439239 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1282439239 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out1282439239| ~x$r_buff1_thd3~0_In1282439239)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1282439239| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1282439239, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1282439239, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1282439239, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1282439239} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1282439239|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1282439239, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1282439239, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1282439239, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1282439239} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 15:01:31,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= v_~x$r_buff1_thd3~0_52 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_53 1) v_~__unbuffered_cnt~0_52) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 15:01:31,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In885618846 ~x$r_buff0_thd2~0_Out885618846)) (.cse0 (= (mod ~x$w_buff0_used~0_In885618846 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In885618846 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (not .cse0) (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out885618846)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In885618846, ~x$w_buff0_used~0=~x$w_buff0_used~0_In885618846} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out885618846|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out885618846, ~x$w_buff0_used~0=~x$w_buff0_used~0_In885618846} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 15:01:31,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1324798285 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1324798285 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1324798285 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1324798285 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1324798285| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-1324798285| ~x$r_buff1_thd2~0_In-1324798285)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1324798285, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1324798285, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1324798285, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1324798285} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1324798285|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1324798285, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1324798285, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1324798285, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1324798285} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 15:01:31,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork0_#t~ite31_28|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 15:01:31,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 15:01:31,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_27 256) 0) (= (mod v_~x$w_buff0_used~0_180 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 15:01:31,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In241933967 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In241933967 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out241933967| ~x$w_buff1~0_In241933967) (not .cse1)) (and (= ~x~0_In241933967 |ULTIMATE.start_main_#t~ite41_Out241933967|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In241933967, ~x$w_buff1_used~0=~x$w_buff1_used~0_In241933967, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In241933967, ~x~0=~x~0_In241933967} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out241933967|, ~x$w_buff1~0=~x$w_buff1~0_In241933967, ~x$w_buff1_used~0=~x$w_buff1_used~0_In241933967, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In241933967, ~x~0=~x~0_In241933967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 15:01:31,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_26 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 15:01:31,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1816168862 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1816168862 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1816168862| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1816168862 |ULTIMATE.start_main_#t~ite43_Out-1816168862|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1816168862, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1816168862} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1816168862, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1816168862|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1816168862} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 15:01:31,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In1000501687 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1000501687 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1000501687 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1000501687 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1000501687 |ULTIMATE.start_main_#t~ite44_Out1000501687|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite44_Out1000501687|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1000501687, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1000501687, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1000501687, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1000501687} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1000501687, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1000501687, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1000501687, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1000501687|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1000501687} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 15:01:31,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2022107037 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In2022107037 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out2022107037| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out2022107037| ~x$r_buff0_thd0~0_In2022107037)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2022107037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2022107037} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2022107037, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2022107037|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2022107037} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 15:01:31,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1326652511 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1326652511 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1326652511 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1326652511 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out1326652511| ~x$r_buff1_thd0~0_In1326652511)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out1326652511| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1326652511, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1326652511, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1326652511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1326652511} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1326652511, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1326652511|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1326652511, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1326652511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1326652511} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 15:01:31,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite46_48|) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_48 0) (= 1 v_~__unbuffered_p2_EAX~0_27) (= 1 v_~__unbuffered_p0_EAX~0_42))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:01:31,070 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_00e753af-cca7-48a1-a394-2a117540f038/bin/uautomizer/witness.graphml [2019-12-07 15:01:31,070 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:01:31,071 INFO L168 Benchmark]: Toolchain (without parser) took 52715.33 ms. Allocated memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: 4.5 GB). Free memory was 934.4 MB in the beginning and 4.5 GB in the end (delta: -3.6 GB). Peak memory consumption was 951.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:31,071 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:01:31,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:31,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.96 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:31,072 INFO L168 Benchmark]: Boogie Preprocessor took 33.57 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-12-07 15:01:31,073 INFO L168 Benchmark]: RCFGBuilder took 400.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:31,073 INFO L168 Benchmark]: TraceAbstraction took 51739.28 ms. Allocated memory was 1.2 GB in the beginning and 5.5 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 862.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:31,074 INFO L168 Benchmark]: Witness Printer took 75.42 ms. Allocated memory is still 5.5 GB. Free memory was 4.6 GB in the beginning and 4.5 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:31,076 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 418.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.96 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.57 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 400.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51739.28 ms. Allocated memory was 1.2 GB in the beginning and 5.5 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 862.9 MB. Max. memory is 11.5 GB. * Witness Printer took 75.42 ms. Allocated memory is still 5.5 GB. Free memory was 4.6 GB in the beginning and 4.5 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 164 ProgramPointsBefore, 81 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6883 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 110 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 64821 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2058, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2059, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2060, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 51.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3276 SDtfs, 5548 SDslu, 10947 SDs, 0 SdLazy, 6060 SolverSat, 282 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 21 SyntacticMatches, 16 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134187occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 117545 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 700 NumberOfCodeBlocks, 700 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 152083 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...