./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021_rmo.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_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/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 2810b03a0835a23663296d6c5578f85e50e93dfa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 17:22:36,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:22:36,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:22:36,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:22:36,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:22:36,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:22:36,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:22:36,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:22:36,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:22:36,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:22:36,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:22:36,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:22:36,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:22:36,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:22:36,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:22:36,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:22:36,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:22:36,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:22:36,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:22:36,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:22:36,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:22:36,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:22:36,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:22:36,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:22:36,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:22:36,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:22:36,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:22:36,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:22:36,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:22:36,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:22:36,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:22:36,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:22:36,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:22:36,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:22:36,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:22:36,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:22:36,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:22:36,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:22:36,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:22:36,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:22:36,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:22:36,866 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:22:36,876 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:22:36,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:22:36,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:22:36,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:22:36,877 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:22:36,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:22:36,878 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:22:36,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:22:36,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:22:36,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:22:36,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:22:36,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:22:36,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:22:36,879 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:22:36,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:22:36,879 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:22:36,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:22:36,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:22:36,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:22:36,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:22:36,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:22:36,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:22:36,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:22:36,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:22:36,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:22:36,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:22:36,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:22:36,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:22:36,880 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:22:36,880 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_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/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 -> 2810b03a0835a23663296d6c5578f85e50e93dfa [2019-12-07 17:22:36,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:22:36,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:22:36,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:22:36,996 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:22:36,997 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:22:36,997 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix021_rmo.opt.i [2019-12-07 17:22:37,041 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/bin/uautomizer/data/9faf1bcdb/009f666bd84a41a99ba41cf41b8e3e02/FLAG33a30e2bb [2019-12-07 17:22:37,533 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:22:37,534 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/sv-benchmarks/c/pthread-wmm/mix021_rmo.opt.i [2019-12-07 17:22:37,545 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/bin/uautomizer/data/9faf1bcdb/009f666bd84a41a99ba41cf41b8e3e02/FLAG33a30e2bb [2019-12-07 17:22:37,553 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/bin/uautomizer/data/9faf1bcdb/009f666bd84a41a99ba41cf41b8e3e02 [2019-12-07 17:22:37,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:22:37,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:22:37,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:22:37,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:22:37,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:22:37,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:22:37" (1/1) ... [2019-12-07 17:22:37,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:37, skipping insertion in model container [2019-12-07 17:22:37,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:22:37" (1/1) ... [2019-12-07 17:22:37,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:22:37,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:22:37,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:22:37,887 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:22:37,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:22:37,979 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:22:37,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:37 WrapperNode [2019-12-07 17:22:37,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:22:37,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:22:37,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:22:37,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:22:37,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:37" (1/1) ... [2019-12-07 17:22:38,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:37" (1/1) ... [2019-12-07 17:22:38,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:22:38,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:22:38,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:22:38,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:22:38,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:37" (1/1) ... [2019-12-07 17:22:38,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:37" (1/1) ... [2019-12-07 17:22:38,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:37" (1/1) ... [2019-12-07 17:22:38,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:37" (1/1) ... [2019-12-07 17:22:38,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:37" (1/1) ... [2019-12-07 17:22:38,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:37" (1/1) ... [2019-12-07 17:22:38,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:37" (1/1) ... [2019-12-07 17:22:38,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:22:38,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:22:38,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:22:38,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:22:38,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/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 17:22:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:22:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:22:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:22:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:22:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:22:38,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:22:38,090 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:22:38,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:22:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:22:38,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:22:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 17:22:38,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 17:22:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:22:38,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:22:38,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:22:38,092 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 17:22:38,508 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:22:38,508 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:22:38,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:22:38 BoogieIcfgContainer [2019-12-07 17:22:38,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:22:38,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:22:38,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:22:38,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:22:38,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:22:37" (1/3) ... [2019-12-07 17:22:38,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d640598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:22:38, skipping insertion in model container [2019-12-07 17:22:38,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:37" (2/3) ... [2019-12-07 17:22:38,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d640598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:22:38, skipping insertion in model container [2019-12-07 17:22:38,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:22:38" (3/3) ... [2019-12-07 17:22:38,514 INFO L109 eAbstractionObserver]: Analyzing ICFG mix021_rmo.opt.i [2019-12-07 17:22:38,520 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:22:38,520 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:22:38,525 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:22:38,526 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:22:38,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,553 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,553 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,554 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,554 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,555 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,555 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,568 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,568 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,568 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,568 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,569 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,569 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,569 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,569 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,569 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,569 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,569 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,574 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:22:38,594 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 17:22:38,606 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:22:38,606 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:22:38,606 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:22:38,606 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:22:38,606 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:22:38,606 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:22:38,606 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:22:38,607 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:22:38,617 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 253 transitions [2019-12-07 17:22:38,619 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 210 places, 253 transitions [2019-12-07 17:22:38,683 INFO L134 PetriNetUnfolder]: 56/249 cut-off events. [2019-12-07 17:22:38,683 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:22:38,696 INFO L76 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 249 events. 56/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 12/203 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:22:38,719 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 210 places, 253 transitions [2019-12-07 17:22:38,762 INFO L134 PetriNetUnfolder]: 56/249 cut-off events. [2019-12-07 17:22:38,762 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:22:38,771 INFO L76 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 249 events. 56/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 12/203 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:22:38,797 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 17:22:38,798 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:22:42,489 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 17:22:42,736 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 17:22:42,859 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146481 [2019-12-07 17:22:42,860 INFO L214 etLargeBlockEncoding]: Total number of compositions: 131 [2019-12-07 17:22:42,862 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-07 17:22:51,608 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 93550 states. [2019-12-07 17:22:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 93550 states. [2019-12-07 17:22:51,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:22:51,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:51,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:22:51,615 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:51,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:51,619 INFO L82 PathProgramCache]: Analyzing trace with hash 155254263, now seen corresponding path program 1 times [2019-12-07 17:22:51,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:51,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673526263] [2019-12-07 17:22:51,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:51,777 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 17:22:51,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673526263] [2019-12-07 17:22:51,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:51,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:22:51,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012907779] [2019-12-07 17:22:51,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:22:51,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:51,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:22:51,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:22:51,792 INFO L87 Difference]: Start difference. First operand 93550 states. Second operand 3 states. [2019-12-07 17:22:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:52,420 INFO L93 Difference]: Finished difference Result 92966 states and 426320 transitions. [2019-12-07 17:22:52,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:22:52,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 17:22:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:52,966 INFO L225 Difference]: With dead ends: 92966 [2019-12-07 17:22:52,966 INFO L226 Difference]: Without dead ends: 86602 [2019-12-07 17:22:52,967 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 17:22:54,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86602 states. [2019-12-07 17:22:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86602 to 86602. [2019-12-07 17:22:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86602 states. [2019-12-07 17:22:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86602 states to 86602 states and 396876 transitions. [2019-12-07 17:22:56,202 INFO L78 Accepts]: Start accepts. Automaton has 86602 states and 396876 transitions. Word has length 9 [2019-12-07 17:22:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:56,203 INFO L462 AbstractCegarLoop]: Abstraction has 86602 states and 396876 transitions. [2019-12-07 17:22:56,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:22:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 86602 states and 396876 transitions. [2019-12-07 17:22:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:22:56,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:56,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:22:56,209 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:56,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:56,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1923219547, now seen corresponding path program 1 times [2019-12-07 17:22:56,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:56,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119089630] [2019-12-07 17:22:56,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:56,271 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 17:22:56,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119089630] [2019-12-07 17:22:56,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:56,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:22:56,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102947024] [2019-12-07 17:22:56,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:22:56,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:56,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:22:56,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:22:56,273 INFO L87 Difference]: Start difference. First operand 86602 states and 396876 transitions. Second operand 4 states. [2019-12-07 17:22:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:57,163 INFO L93 Difference]: Finished difference Result 138074 states and 610572 transitions. [2019-12-07 17:22:57,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:22:57,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 17:22:57,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:59,537 INFO L225 Difference]: With dead ends: 138074 [2019-12-07 17:22:59,537 INFO L226 Difference]: Without dead ends: 138002 [2019-12-07 17:22:59,537 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 17:23:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138002 states. [2019-12-07 17:23:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138002 to 133994. [2019-12-07 17:23:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133994 states. [2019-12-07 17:23:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133994 states to 133994 states and 595808 transitions. [2019-12-07 17:23:03,526 INFO L78 Accepts]: Start accepts. Automaton has 133994 states and 595808 transitions. Word has length 15 [2019-12-07 17:23:03,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:03,527 INFO L462 AbstractCegarLoop]: Abstraction has 133994 states and 595808 transitions. [2019-12-07 17:23:03,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:23:03,527 INFO L276 IsEmpty]: Start isEmpty. Operand 133994 states and 595808 transitions. [2019-12-07 17:23:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:23:03,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:03,533 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 17:23:03,533 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:03,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1961000002, now seen corresponding path program 1 times [2019-12-07 17:23:03,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:03,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919003295] [2019-12-07 17:23:03,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,581 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 17:23:03,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919003295] [2019-12-07 17:23:03,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:23:03,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:23:03,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670199207] [2019-12-07 17:23:03,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:23:03,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:03,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:23:03,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:23:03,582 INFO L87 Difference]: Start difference. First operand 133994 states and 595808 transitions. Second operand 4 states. [2019-12-07 17:23:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:04,523 INFO L93 Difference]: Finished difference Result 171690 states and 753612 transitions. [2019-12-07 17:23:04,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:23:04,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 17:23:04,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:05,060 INFO L225 Difference]: With dead ends: 171690 [2019-12-07 17:23:05,061 INFO L226 Difference]: Without dead ends: 171630 [2019-12-07 17:23:05,061 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 17:23:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171630 states. [2019-12-07 17:23:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171630 to 153202. [2019-12-07 17:23:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153202 states. [2019-12-07 17:23:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153202 states to 153202 states and 678068 transitions. [2019-12-07 17:23:11,872 INFO L78 Accepts]: Start accepts. Automaton has 153202 states and 678068 transitions. Word has length 18 [2019-12-07 17:23:11,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:11,872 INFO L462 AbstractCegarLoop]: Abstraction has 153202 states and 678068 transitions. [2019-12-07 17:23:11,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:23:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 153202 states and 678068 transitions. [2019-12-07 17:23:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:23:11,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:11,882 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:11,882 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:11,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:11,882 INFO L82 PathProgramCache]: Analyzing trace with hash 661487434, now seen corresponding path program 1 times [2019-12-07 17:23:11,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:11,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124932932] [2019-12-07 17:23:11,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:23:11,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124932932] [2019-12-07 17:23:11,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:23:11,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:23:11,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694611568] [2019-12-07 17:23:11,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:23:11,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:11,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:23:11,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:23:11,913 INFO L87 Difference]: Start difference. First operand 153202 states and 678068 transitions. Second operand 3 states. [2019-12-07 17:23:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:13,232 INFO L93 Difference]: Finished difference Result 255766 states and 1092468 transitions. [2019-12-07 17:23:13,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:23:13,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:23:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:13,989 INFO L225 Difference]: With dead ends: 255766 [2019-12-07 17:23:13,989 INFO L226 Difference]: Without dead ends: 255766 [2019-12-07 17:23:13,989 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 17:23:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255766 states. [2019-12-07 17:23:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255766 to 227670. [2019-12-07 17:23:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227670 states. [2019-12-07 17:23:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227670 states to 227670 states and 984460 transitions. [2019-12-07 17:23:23,007 INFO L78 Accepts]: Start accepts. Automaton has 227670 states and 984460 transitions. Word has length 19 [2019-12-07 17:23:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:23,008 INFO L462 AbstractCegarLoop]: Abstraction has 227670 states and 984460 transitions. [2019-12-07 17:23:23,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:23:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 227670 states and 984460 transitions. [2019-12-07 17:23:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:23:23,021 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:23,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:23,021 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:23,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:23,021 INFO L82 PathProgramCache]: Analyzing trace with hash 301900253, now seen corresponding path program 1 times [2019-12-07 17:23:23,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:23,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659140550] [2019-12-07 17:23:23,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:23,492 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 17:23:23,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659140550] [2019-12-07 17:23:23,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:23:23,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:23:23,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455777948] [2019-12-07 17:23:23,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:23:23,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:23,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:23:23,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:23:23,494 INFO L87 Difference]: Start difference. First operand 227670 states and 984460 transitions. Second operand 3 states. [2019-12-07 17:23:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:24,634 INFO L93 Difference]: Finished difference Result 227670 states and 973664 transitions. [2019-12-07 17:23:24,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:23:24,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:23:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:25,293 INFO L225 Difference]: With dead ends: 227670 [2019-12-07 17:23:25,293 INFO L226 Difference]: Without dead ends: 227670 [2019-12-07 17:23:25,293 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 17:23:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227670 states. [2019-12-07 17:23:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227670 to 225646. [2019-12-07 17:23:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225646 states. [2019-12-07 17:23:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225646 states to 225646 states and 965864 transitions. [2019-12-07 17:23:35,097 INFO L78 Accepts]: Start accepts. Automaton has 225646 states and 965864 transitions. Word has length 20 [2019-12-07 17:23:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:35,097 INFO L462 AbstractCegarLoop]: Abstraction has 225646 states and 965864 transitions. [2019-12-07 17:23:35,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:23:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 225646 states and 965864 transitions. [2019-12-07 17:23:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:23:35,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:35,107 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:35,107 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:35,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1488828346, now seen corresponding path program 1 times [2019-12-07 17:23:35,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:35,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144239330] [2019-12-07 17:23:35,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:35,164 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 17:23:35,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144239330] [2019-12-07 17:23:35,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:23:35,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:23:35,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904103184] [2019-12-07 17:23:35,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:23:35,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:35,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:23:35,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:23:35,166 INFO L87 Difference]: Start difference. First operand 225646 states and 965864 transitions. Second operand 3 states. [2019-12-07 17:23:37,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:37,415 INFO L93 Difference]: Finished difference Result 392289 states and 1609867 transitions. [2019-12-07 17:23:37,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:23:37,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:23:37,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:38,412 INFO L225 Difference]: With dead ends: 392289 [2019-12-07 17:23:38,412 INFO L226 Difference]: Without dead ends: 390867 [2019-12-07 17:23:38,412 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 17:23:41,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390867 states. [2019-12-07 17:23:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390867 to 376641. [2019-12-07 17:23:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376641 states. [2019-12-07 17:23:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376641 states to 376641 states and 1560668 transitions. [2019-12-07 17:23:49,598 INFO L78 Accepts]: Start accepts. Automaton has 376641 states and 1560668 transitions. Word has length 20 [2019-12-07 17:23:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:49,599 INFO L462 AbstractCegarLoop]: Abstraction has 376641 states and 1560668 transitions. [2019-12-07 17:23:49,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:23:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 376641 states and 1560668 transitions. [2019-12-07 17:23:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:23:49,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:49,620 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:49,620 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1251839182, now seen corresponding path program 1 times [2019-12-07 17:23:49,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:49,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724073142] [2019-12-07 17:23:49,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:49,659 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 17:23:49,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724073142] [2019-12-07 17:23:49,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:23:49,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:23:49,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466201858] [2019-12-07 17:23:49,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:23:49,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:49,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:23:49,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:23:49,661 INFO L87 Difference]: Start difference. First operand 376641 states and 1560668 transitions. Second operand 4 states. [2019-12-07 17:23:55,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:55,823 INFO L93 Difference]: Finished difference Result 465181 states and 1907392 transitions. [2019-12-07 17:23:55,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:23:55,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 17:23:55,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:57,188 INFO L225 Difference]: With dead ends: 465181 [2019-12-07 17:23:57,188 INFO L226 Difference]: Without dead ends: 465109 [2019-12-07 17:23:57,189 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 17:24:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465109 states. [2019-12-07 17:24:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465109 to 381324. [2019-12-07 17:24:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381324 states. [2019-12-07 17:24:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381324 states to 381324 states and 1579994 transitions. [2019-12-07 17:24:07,913 INFO L78 Accepts]: Start accepts. Automaton has 381324 states and 1579994 transitions. Word has length 21 [2019-12-07 17:24:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:07,913 INFO L462 AbstractCegarLoop]: Abstraction has 381324 states and 1579994 transitions. [2019-12-07 17:24:07,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 381324 states and 1579994 transitions. [2019-12-07 17:24:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:24:07,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:07,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:07,935 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:07,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:07,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1027281216, now seen corresponding path program 1 times [2019-12-07 17:24:07,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:07,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917221821] [2019-12-07 17:24:07,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:07,988 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 17:24:07,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917221821] [2019-12-07 17:24:07,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:07,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:24:07,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61315736] [2019-12-07 17:24:07,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:07,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:07,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:07,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:07,990 INFO L87 Difference]: Start difference. First operand 381324 states and 1579994 transitions. Second operand 4 states. [2019-12-07 17:24:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:10,269 INFO L93 Difference]: Finished difference Result 381504 states and 1566191 transitions. [2019-12-07 17:24:10,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:24:10,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 17:24:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:15,322 INFO L225 Difference]: With dead ends: 381504 [2019-12-07 17:24:15,322 INFO L226 Difference]: Without dead ends: 381030 [2019-12-07 17:24:15,322 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 17:24:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381030 states. [2019-12-07 17:24:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381030 to 376114. [2019-12-07 17:24:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376114 states. [2019-12-07 17:24:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376114 states to 376114 states and 1552929 transitions. [2019-12-07 17:24:25,152 INFO L78 Accepts]: Start accepts. Automaton has 376114 states and 1552929 transitions. Word has length 21 [2019-12-07 17:24:25,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:25,153 INFO L462 AbstractCegarLoop]: Abstraction has 376114 states and 1552929 transitions. [2019-12-07 17:24:25,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 376114 states and 1552929 transitions. [2019-12-07 17:24:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:24:25,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:25,177 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 17:24:25,177 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1200590819, now seen corresponding path program 1 times [2019-12-07 17:24:25,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:25,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116632656] [2019-12-07 17:24:25,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:25,209 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 17:24:25,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116632656] [2019-12-07 17:24:25,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:25,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:25,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183469962] [2019-12-07 17:24:25,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:25,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:25,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:25,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:25,211 INFO L87 Difference]: Start difference. First operand 376114 states and 1552929 transitions. Second operand 4 states. [2019-12-07 17:24:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:25,681 INFO L93 Difference]: Finished difference Result 127287 states and 424553 transitions. [2019-12-07 17:24:25,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:24:25,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 17:24:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:25,915 INFO L225 Difference]: With dead ends: 127287 [2019-12-07 17:24:25,915 INFO L226 Difference]: Without dead ends: 127287 [2019-12-07 17:24:25,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:26,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127287 states. [2019-12-07 17:24:28,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127287 to 122927. [2019-12-07 17:24:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122927 states. [2019-12-07 17:24:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122927 states to 122927 states and 409209 transitions. [2019-12-07 17:24:28,645 INFO L78 Accepts]: Start accepts. Automaton has 122927 states and 409209 transitions. Word has length 22 [2019-12-07 17:24:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:28,646 INFO L462 AbstractCegarLoop]: Abstraction has 122927 states and 409209 transitions. [2019-12-07 17:24:28,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:28,646 INFO L276 IsEmpty]: Start isEmpty. Operand 122927 states and 409209 transitions. [2019-12-07 17:24:28,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:24:28,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:28,655 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] [2019-12-07 17:24:28,655 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:28,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:28,655 INFO L82 PathProgramCache]: Analyzing trace with hash 608760049, now seen corresponding path program 1 times [2019-12-07 17:24:28,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:28,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882721470] [2019-12-07 17:24:28,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:28,685 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 17:24:28,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882721470] [2019-12-07 17:24:28,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:28,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:24:28,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179139748] [2019-12-07 17:24:28,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:24:28,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:28,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:24:28,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:24:28,687 INFO L87 Difference]: Start difference. First operand 122927 states and 409209 transitions. Second operand 5 states. [2019-12-07 17:24:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:28,774 INFO L93 Difference]: Finished difference Result 23109 states and 70515 transitions. [2019-12-07 17:24:28,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:24:28,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 17:24:28,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:28,805 INFO L225 Difference]: With dead ends: 23109 [2019-12-07 17:24:28,805 INFO L226 Difference]: Without dead ends: 23109 [2019-12-07 17:24:28,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:24:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23109 states. [2019-12-07 17:24:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23109 to 18549. [2019-12-07 17:24:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18549 states. [2019-12-07 17:24:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18549 states to 18549 states and 57419 transitions. [2019-12-07 17:24:29,079 INFO L78 Accepts]: Start accepts. Automaton has 18549 states and 57419 transitions. Word has length 23 [2019-12-07 17:24:29,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:29,080 INFO L462 AbstractCegarLoop]: Abstraction has 18549 states and 57419 transitions. [2019-12-07 17:24:29,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:24:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 18549 states and 57419 transitions. [2019-12-07 17:24:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:24:29,093 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:29,094 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] [2019-12-07 17:24:29,094 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:29,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:29,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1657235238, now seen corresponding path program 1 times [2019-12-07 17:24:29,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:29,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200747183] [2019-12-07 17:24:29,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:29,132 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 17:24:29,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200747183] [2019-12-07 17:24:29,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:29,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:29,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101642746] [2019-12-07 17:24:29,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:24:29,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:29,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:24:29,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:24:29,134 INFO L87 Difference]: Start difference. First operand 18549 states and 57419 transitions. Second operand 5 states. [2019-12-07 17:24:29,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:29,424 INFO L93 Difference]: Finished difference Result 24583 states and 73609 transitions. [2019-12-07 17:24:29,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:24:29,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 17:24:29,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:29,458 INFO L225 Difference]: With dead ends: 24583 [2019-12-07 17:24:29,458 INFO L226 Difference]: Without dead ends: 24582 [2019-12-07 17:24:29,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 17:24:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24582 states. [2019-12-07 17:24:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24582 to 22952. [2019-12-07 17:24:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22952 states. [2019-12-07 17:24:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22952 states to 22952 states and 69832 transitions. [2019-12-07 17:24:29,780 INFO L78 Accepts]: Start accepts. Automaton has 22952 states and 69832 transitions. Word has length 34 [2019-12-07 17:24:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:29,781 INFO L462 AbstractCegarLoop]: Abstraction has 22952 states and 69832 transitions. [2019-12-07 17:24:29,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:24:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand 22952 states and 69832 transitions. [2019-12-07 17:24:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:24:29,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:29,799 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] [2019-12-07 17:24:29,799 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:29,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1227997864, now seen corresponding path program 1 times [2019-12-07 17:24:29,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:29,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178834440] [2019-12-07 17:24:29,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:29,832 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 17:24:29,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178834440] [2019-12-07 17:24:29,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:29,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:29,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573729259] [2019-12-07 17:24:29,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:29,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:29,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:29,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:29,833 INFO L87 Difference]: Start difference. First operand 22952 states and 69832 transitions. Second operand 3 states. [2019-12-07 17:24:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:29,928 INFO L93 Difference]: Finished difference Result 24115 states and 69458 transitions. [2019-12-07 17:24:29,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:29,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 17:24:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:29,956 INFO L225 Difference]: With dead ends: 24115 [2019-12-07 17:24:29,956 INFO L226 Difference]: Without dead ends: 24115 [2019-12-07 17:24:29,956 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 17:24:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24115 states. [2019-12-07 17:24:30,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24115 to 22954. [2019-12-07 17:24:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22954 states. [2019-12-07 17:24:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22954 states to 22954 states and 66772 transitions. [2019-12-07 17:24:30,318 INFO L78 Accepts]: Start accepts. Automaton has 22954 states and 66772 transitions. Word has length 37 [2019-12-07 17:24:30,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:30,318 INFO L462 AbstractCegarLoop]: Abstraction has 22954 states and 66772 transitions. [2019-12-07 17:24:30,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand 22954 states and 66772 transitions. [2019-12-07 17:24:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:24:30,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:30,333 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 17:24:30,333 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:30,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:30,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1861511259, now seen corresponding path program 1 times [2019-12-07 17:24:30,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:30,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448574361] [2019-12-07 17:24:30,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:30,374 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 17:24:30,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448574361] [2019-12-07 17:24:30,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:30,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:24:30,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620268285] [2019-12-07 17:24:30,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:24:30,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:30,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:24:30,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:24:30,376 INFO L87 Difference]: Start difference. First operand 22954 states and 66772 transitions. Second operand 6 states. [2019-12-07 17:24:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:30,459 INFO L93 Difference]: Finished difference Result 18136 states and 56327 transitions. [2019-12-07 17:24:30,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:24:30,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 17:24:30,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:30,483 INFO L225 Difference]: With dead ends: 18136 [2019-12-07 17:24:30,483 INFO L226 Difference]: Without dead ends: 18058 [2019-12-07 17:24:30,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:24:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18058 states. [2019-12-07 17:24:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18058 to 14413. [2019-12-07 17:24:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14413 states. [2019-12-07 17:24:30,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14413 states to 14413 states and 46705 transitions. [2019-12-07 17:24:30,709 INFO L78 Accepts]: Start accepts. Automaton has 14413 states and 46705 transitions. Word has length 39 [2019-12-07 17:24:30,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:30,709 INFO L462 AbstractCegarLoop]: Abstraction has 14413 states and 46705 transitions. [2019-12-07 17:24:30,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:24:30,710 INFO L276 IsEmpty]: Start isEmpty. Operand 14413 states and 46705 transitions. [2019-12-07 17:24:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:24:30,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:30,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:30,725 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:30,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:30,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1839454534, now seen corresponding path program 1 times [2019-12-07 17:24:30,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:30,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533590865] [2019-12-07 17:24:30,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:30,794 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 17:24:30,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533590865] [2019-12-07 17:24:30,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:30,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:30,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138051322] [2019-12-07 17:24:30,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:30,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:30,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:30,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:30,795 INFO L87 Difference]: Start difference. First operand 14413 states and 46705 transitions. Second operand 4 states. [2019-12-07 17:24:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:30,883 INFO L93 Difference]: Finished difference Result 24177 states and 75346 transitions. [2019-12-07 17:24:30,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:24:30,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 17:24:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:30,911 INFO L225 Difference]: With dead ends: 24177 [2019-12-07 17:24:30,911 INFO L226 Difference]: Without dead ends: 22069 [2019-12-07 17:24:30,912 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 17:24:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22069 states. [2019-12-07 17:24:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22069 to 13237. [2019-12-07 17:24:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13237 states. [2019-12-07 17:24:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13237 states to 13237 states and 42623 transitions. [2019-12-07 17:24:31,143 INFO L78 Accepts]: Start accepts. Automaton has 13237 states and 42623 transitions. Word has length 65 [2019-12-07 17:24:31,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:31,143 INFO L462 AbstractCegarLoop]: Abstraction has 13237 states and 42623 transitions. [2019-12-07 17:24:31,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 13237 states and 42623 transitions. [2019-12-07 17:24:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:24:31,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:31,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:31,159 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash 836099454, now seen corresponding path program 2 times [2019-12-07 17:24:31,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:31,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031403753] [2019-12-07 17:24:31,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:31,240 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 17:24:31,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031403753] [2019-12-07 17:24:31,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:31,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:24:31,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211391681] [2019-12-07 17:24:31,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:31,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:31,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:31,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:31,242 INFO L87 Difference]: Start difference. First operand 13237 states and 42623 transitions. Second operand 4 states. [2019-12-07 17:24:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:31,480 INFO L93 Difference]: Finished difference Result 20802 states and 66108 transitions. [2019-12-07 17:24:31,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:24:31,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 17:24:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:31,506 INFO L225 Difference]: With dead ends: 20802 [2019-12-07 17:24:31,506 INFO L226 Difference]: Without dead ends: 20802 [2019-12-07 17:24:31,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 17:24:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20802 states. [2019-12-07 17:24:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20802 to 14289. [2019-12-07 17:24:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14289 states. [2019-12-07 17:24:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14289 states to 14289 states and 45395 transitions. [2019-12-07 17:24:31,729 INFO L78 Accepts]: Start accepts. Automaton has 14289 states and 45395 transitions. Word has length 65 [2019-12-07 17:24:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:31,729 INFO L462 AbstractCegarLoop]: Abstraction has 14289 states and 45395 transitions. [2019-12-07 17:24:31,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 14289 states and 45395 transitions. [2019-12-07 17:24:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:24:31,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:31,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:31,743 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:31,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:31,744 INFO L82 PathProgramCache]: Analyzing trace with hash -346208662, now seen corresponding path program 3 times [2019-12-07 17:24:31,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:31,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694973360] [2019-12-07 17:24:31,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:31,825 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 17:24:31,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694973360] [2019-12-07 17:24:31,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:31,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:24:31,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322900296] [2019-12-07 17:24:31,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:24:31,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:31,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:24:31,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:24:31,827 INFO L87 Difference]: Start difference. First operand 14289 states and 45395 transitions. Second operand 5 states. [2019-12-07 17:24:31,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:31,929 INFO L93 Difference]: Finished difference Result 25826 states and 78070 transitions. [2019-12-07 17:24:31,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:24:31,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 17:24:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:31,946 INFO L225 Difference]: With dead ends: 25826 [2019-12-07 17:24:31,946 INFO L226 Difference]: Without dead ends: 13490 [2019-12-07 17:24:31,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:24:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13490 states. [2019-12-07 17:24:32,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13490 to 9037. [2019-12-07 17:24:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9037 states. [2019-12-07 17:24:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9037 states to 9037 states and 26000 transitions. [2019-12-07 17:24:32,078 INFO L78 Accepts]: Start accepts. Automaton has 9037 states and 26000 transitions. Word has length 65 [2019-12-07 17:24:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:32,078 INFO L462 AbstractCegarLoop]: Abstraction has 9037 states and 26000 transitions. [2019-12-07 17:24:32,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:24:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 9037 states and 26000 transitions. [2019-12-07 17:24:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:24:32,086 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:32,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:32,086 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1989033314, now seen corresponding path program 4 times [2019-12-07 17:24:32,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:32,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592134610] [2019-12-07 17:24:32,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:32,178 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 17:24:32,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592134610] [2019-12-07 17:24:32,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:32,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:24:32,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385732535] [2019-12-07 17:24:32,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:24:32,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:32,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:24:32,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:24:32,180 INFO L87 Difference]: Start difference. First operand 9037 states and 26000 transitions. Second operand 7 states. [2019-12-07 17:24:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:32,358 INFO L93 Difference]: Finished difference Result 18573 states and 53721 transitions. [2019-12-07 17:24:32,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:24:32,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 17:24:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:32,373 INFO L225 Difference]: With dead ends: 18573 [2019-12-07 17:24:32,373 INFO L226 Difference]: Without dead ends: 14158 [2019-12-07 17:24:32,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:24:32,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14158 states. [2019-12-07 17:24:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14158 to 9115. [2019-12-07 17:24:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2019-12-07 17:24:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 26165 transitions. [2019-12-07 17:24:32,523 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 26165 transitions. Word has length 65 [2019-12-07 17:24:32,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:32,523 INFO L462 AbstractCegarLoop]: Abstraction has 9115 states and 26165 transitions. [2019-12-07 17:24:32,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:24:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 26165 transitions. [2019-12-07 17:24:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:24:32,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:32,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:32,531 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:32,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:32,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1976633526, now seen corresponding path program 1 times [2019-12-07 17:24:32,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:32,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331789279] [2019-12-07 17:24:32,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:32,588 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 17:24:32,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331789279] [2019-12-07 17:24:32,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:32,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:32,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386747696] [2019-12-07 17:24:32,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:32,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:32,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:32,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:32,590 INFO L87 Difference]: Start difference. First operand 9115 states and 26165 transitions. Second operand 4 states. [2019-12-07 17:24:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:32,639 INFO L93 Difference]: Finished difference Result 14122 states and 37986 transitions. [2019-12-07 17:24:32,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:24:32,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 17:24:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:32,645 INFO L225 Difference]: With dead ends: 14122 [2019-12-07 17:24:32,645 INFO L226 Difference]: Without dead ends: 5986 [2019-12-07 17:24:32,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2019-12-07 17:24:32,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 5518. [2019-12-07 17:24:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5518 states. [2019-12-07 17:24:32,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5518 states to 5518 states and 13812 transitions. [2019-12-07 17:24:32,704 INFO L78 Accepts]: Start accepts. Automaton has 5518 states and 13812 transitions. Word has length 66 [2019-12-07 17:24:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:32,705 INFO L462 AbstractCegarLoop]: Abstraction has 5518 states and 13812 transitions. [2019-12-07 17:24:32,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 5518 states and 13812 transitions. [2019-12-07 17:24:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:24:32,708 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:32,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:32,709 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:32,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:32,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1477659340, now seen corresponding path program 2 times [2019-12-07 17:24:32,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:32,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503152979] [2019-12-07 17:24:32,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:32,776 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 17:24:32,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503152979] [2019-12-07 17:24:32,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:32,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:24:32,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610181390] [2019-12-07 17:24:32,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:24:32,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:32,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:24:32,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:24:32,777 INFO L87 Difference]: Start difference. First operand 5518 states and 13812 transitions. Second operand 6 states. [2019-12-07 17:24:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:33,013 INFO L93 Difference]: Finished difference Result 6158 states and 15183 transitions. [2019-12-07 17:24:33,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:24:33,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-07 17:24:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:33,018 INFO L225 Difference]: With dead ends: 6158 [2019-12-07 17:24:33,019 INFO L226 Difference]: Without dead ends: 6158 [2019-12-07 17:24:33,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:24:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6158 states. [2019-12-07 17:24:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6158 to 5590. [2019-12-07 17:24:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2019-12-07 17:24:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 13944 transitions. [2019-12-07 17:24:33,076 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 13944 transitions. Word has length 66 [2019-12-07 17:24:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:33,076 INFO L462 AbstractCegarLoop]: Abstraction has 5590 states and 13944 transitions. [2019-12-07 17:24:33,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:24:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 13944 transitions. [2019-12-07 17:24:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:24:33,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:33,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:33,080 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:33,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:33,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1478684578, now seen corresponding path program 3 times [2019-12-07 17:24:33,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:33,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110230550] [2019-12-07 17:24:33,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:33,144 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 17:24:33,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110230550] [2019-12-07 17:24:33,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:33,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:33,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613789388] [2019-12-07 17:24:33,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:33,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:33,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:33,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:33,145 INFO L87 Difference]: Start difference. First operand 5590 states and 13944 transitions. Second operand 4 states. [2019-12-07 17:24:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:33,272 INFO L93 Difference]: Finished difference Result 5389 states and 13317 transitions. [2019-12-07 17:24:33,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:24:33,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 17:24:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:33,276 INFO L225 Difference]: With dead ends: 5389 [2019-12-07 17:24:33,276 INFO L226 Difference]: Without dead ends: 5389 [2019-12-07 17:24:33,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 4 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 17:24:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5389 states. [2019-12-07 17:24:33,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5389 to 5352. [2019-12-07 17:24:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5352 states. [2019-12-07 17:24:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5352 states to 5352 states and 13241 transitions. [2019-12-07 17:24:33,330 INFO L78 Accepts]: Start accepts. Automaton has 5352 states and 13241 transitions. Word has length 66 [2019-12-07 17:24:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:33,330 INFO L462 AbstractCegarLoop]: Abstraction has 5352 states and 13241 transitions. [2019-12-07 17:24:33,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 5352 states and 13241 transitions. [2019-12-07 17:24:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:24:33,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:33,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:33,333 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:33,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:33,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1779877316, now seen corresponding path program 1 times [2019-12-07 17:24:33,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:33,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686076817] [2019-12-07 17:24:33,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:33,574 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 17:24:33,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686076817] [2019-12-07 17:24:33,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:33,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 17:24:33,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774231191] [2019-12-07 17:24:33,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:24:33,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:33,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:24:33,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:24:33,575 INFO L87 Difference]: Start difference. First operand 5352 states and 13241 transitions. Second operand 13 states. [2019-12-07 17:24:37,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:37,396 INFO L93 Difference]: Finished difference Result 14288 states and 36110 transitions. [2019-12-07 17:24:37,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 17:24:37,397 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-07 17:24:37,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:37,419 INFO L225 Difference]: With dead ends: 14288 [2019-12-07 17:24:37,419 INFO L226 Difference]: Without dead ends: 14199 [2019-12-07 17:24:37,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 17:24:37,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14199 states. [2019-12-07 17:24:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14199 to 7981. [2019-12-07 17:24:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7981 states. [2019-12-07 17:24:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7981 states to 7981 states and 19830 transitions. [2019-12-07 17:24:37,549 INFO L78 Accepts]: Start accepts. Automaton has 7981 states and 19830 transitions. Word has length 66 [2019-12-07 17:24:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:37,549 INFO L462 AbstractCegarLoop]: Abstraction has 7981 states and 19830 transitions. [2019-12-07 17:24:37,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:24:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 7981 states and 19830 transitions. [2019-12-07 17:24:37,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:24:37,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:37,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:37,556 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:37,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:37,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1663016054, now seen corresponding path program 2 times [2019-12-07 17:24:37,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:37,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330518256] [2019-12-07 17:24:37,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:37,614 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 17:24:37,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330518256] [2019-12-07 17:24:37,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:37,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:37,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956239757] [2019-12-07 17:24:37,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:37,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:37,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:37,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:37,615 INFO L87 Difference]: Start difference. First operand 7981 states and 19830 transitions. Second operand 4 states. [2019-12-07 17:24:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:37,647 INFO L93 Difference]: Finished difference Result 9056 states and 22639 transitions. [2019-12-07 17:24:37,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:24:37,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 17:24:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:37,648 INFO L225 Difference]: With dead ends: 9056 [2019-12-07 17:24:37,648 INFO L226 Difference]: Without dead ends: 717 [2019-12-07 17:24:37,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-12-07 17:24:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 713. [2019-12-07 17:24:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-12-07 17:24:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1485 transitions. [2019-12-07 17:24:37,654 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1485 transitions. Word has length 66 [2019-12-07 17:24:37,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:37,654 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1485 transitions. [2019-12-07 17:24:37,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1485 transitions. [2019-12-07 17:24:37,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:24:37,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:37,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:37,655 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:37,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:37,655 INFO L82 PathProgramCache]: Analyzing trace with hash 977277596, now seen corresponding path program 3 times [2019-12-07 17:24:37,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:37,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600142624] [2019-12-07 17:24:37,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:37,726 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 17:24:37,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600142624] [2019-12-07 17:24:37,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:37,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:24:37,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144566377] [2019-12-07 17:24:37,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:24:37,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:37,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:24:37,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:24:37,727 INFO L87 Difference]: Start difference. First operand 713 states and 1485 transitions. Second operand 8 states. [2019-12-07 17:24:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:37,912 INFO L93 Difference]: Finished difference Result 1171 states and 2390 transitions. [2019-12-07 17:24:37,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:24:37,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-07 17:24:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:37,913 INFO L225 Difference]: With dead ends: 1171 [2019-12-07 17:24:37,913 INFO L226 Difference]: Without dead ends: 787 [2019-12-07 17:24:37,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:24:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-12-07 17:24:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 715. [2019-12-07 17:24:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-12-07 17:24:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1436 transitions. [2019-12-07 17:24:37,919 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1436 transitions. Word has length 66 [2019-12-07 17:24:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:37,919 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1436 transitions. [2019-12-07 17:24:37,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:24:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1436 transitions. [2019-12-07 17:24:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:24:37,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:37,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:37,920 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:37,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1081052920, now seen corresponding path program 4 times [2019-12-07 17:24:37,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:37,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495247240] [2019-12-07 17:24:37,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:24:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:24:37,994 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:24:37,994 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:24:37,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] ULTIMATE.startENTRY-->L849: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= 0 v_~x~0_105) (= 0 v_~z$flush_delayed~0_384) (= v_~z$w_buff1_used~0_989 0) (= 0 v_~__unbuffered_p2_EAX~0_146) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t573~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t573~0.base_37|) |v_ULTIMATE.start_main_~#t573~0.offset_25| 0))) (= |v_#NULL.offset_7| 0) (= 0 v_~z$mem_tmp~0_347) (= v_~z$r_buff1_thd2~0_303 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t573~0.base_37| 4) |v_#length_31|) (< 0 |v_#StackHeapBarrier_21|) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t573~0.base_37|) (= 0 v_~z$r_buff0_thd3~0_515) (= v_~z$r_buff0_thd2~0_71 0) (= v_~__unbuffered_p3_EAX~0_112 0) (= v_~z$w_buff0_used~0_1397 0) (= v_~main$tmp_guard1~0_91 0) (= v_~weak$$choice2~0_438 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_71 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t573~0.base_37|) 0) (= v_~z$r_buff1_thd0~0_430 0) (= v_~z$r_buff1_thd1~0_299 0) (= 0 v_~weak$$choice0~0_336) (= 0 |v_ULTIMATE.start_main_~#t573~0.offset_25|) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~y~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff1~0_562 0) (= 0 |v_#NULL.base_7|) (= 0 v_~__unbuffered_p3_EBX~0_93) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t573~0.base_37| 1)) (= v_~a~0_37 0) (= 0 v_~z$r_buff0_thd4~0_677) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_307 0) (= 0 v_~z$r_buff1_thd4~0_523) (= v_~z$w_buff0~0_773 0) (= v_~z$r_buff0_thd0~0_170 0) (= 0 v_~z$r_buff1_thd3~0_601))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_24|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ULTIMATE.start_main_~#t573~0.base=|v_ULTIMATE.start_main_~#t573~0.base_37|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_303, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_184|, ~a~0=v_~a~0_37, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_677, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_112, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ULTIMATE.start_main_~#t574~0.offset=|v_ULTIMATE.start_main_~#t574~0.offset_17|, ULTIMATE.start_main_~#t576~0.base=|v_ULTIMATE.start_main_~#t576~0.base_23|, ~z$mem_tmp~0=v_~z$mem_tmp~0_347, ULTIMATE.start_main_~#t576~0.offset=|v_ULTIMATE.start_main_~#t576~0.offset_18|, ULTIMATE.start_main_~#t574~0.base=|v_ULTIMATE.start_main_~#t574~0.base_30|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_989, ~z$flush_delayed~0=v_~z$flush_delayed~0_384, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~weak$$choice0~0=v_~weak$$choice0~0_336, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_409|, ULTIMATE.start_main_~#t575~0.base=|v_ULTIMATE.start_main_~#t575~0.base_22|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_299, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_515, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ~x~0=v_~x~0_105, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_523, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_562, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ULTIMATE.start_main_~#t575~0.offset=|v_ULTIMATE.start_main_~#t575~0.offset_18|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_430, ~y~0=v_~y~0_119, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1397, ~z$w_buff0~0=v_~z$w_buff0~0_773, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_601, ULTIMATE.start_main_~#t573~0.offset=|v_ULTIMATE.start_main_~#t573~0.offset_25|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_93, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_67|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_57|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_307, ~weak$$choice2~0=v_~weak$$choice2~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t573~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t574~0.offset, ULTIMATE.start_main_~#t576~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_~#t576~0.offset, ULTIMATE.start_main_~#t574~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t575~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t575~0.offset, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t573~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:24:37,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L849-1-->L851: Formula: (and (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t574~0.base_12| 4) |v_#length_21|) (not (= |v_ULTIMATE.start_main_~#t574~0.base_12| 0)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t574~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t574~0.base_12|) |v_ULTIMATE.start_main_~#t574~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t574~0.offset_10|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t574~0.base_12|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t574~0.base_12|) 0) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t574~0.base_12| 1) |v_#valid_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t574~0.base=|v_ULTIMATE.start_main_~#t574~0.base_12|, #length=|v_#length_21|, ULTIMATE.start_main_~#t574~0.offset=|v_ULTIMATE.start_main_~#t574~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t574~0.base, #length, ULTIMATE.start_main_~#t574~0.offset] because there is no mapped edge [2019-12-07 17:24:37,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L851-1-->L853: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t575~0.base_12|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t575~0.base_12| 4) |v_#length_19|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t575~0.base_12| 1)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t575~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t575~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t575~0.base_12|) |v_ULTIMATE.start_main_~#t575~0.offset_11| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t575~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t575~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t575~0.base=|v_ULTIMATE.start_main_~#t575~0.base_12|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t575~0.offset=|v_ULTIMATE.start_main_~#t575~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t575~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t575~0.offset] because there is no mapped edge [2019-12-07 17:24:37,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t576~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t576~0.base_13|) |v_ULTIMATE.start_main_~#t576~0.offset_11| 3)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t576~0.offset_11| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t576~0.base_13| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t576~0.base_13|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t576~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t576~0.base_13|)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t576~0.base_13| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t576~0.offset=|v_ULTIMATE.start_main_~#t576~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~#t576~0.base=|v_ULTIMATE.start_main_~#t576~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t576~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t576~0.base] because there is no mapped edge [2019-12-07 17:24:37,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_216 v_~z$w_buff1_used~0_129) (= v_~z$w_buff0~0_91 v_~z$w_buff1~0_66) (= v_P3Thread1of1ForFork2_~arg.offset_32 |v_P3Thread1of1ForFork2_#in~arg.offset_34|) (= v_~z$w_buff0_used~0_215 1) (= 1 v_~z$w_buff0~0_90) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_215 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_129 256))))) 1 0)) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 0)) (= |v_P3Thread1of1ForFork2_#in~arg.base_34| v_P3Thread1of1ForFork2_~arg.base_32) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_216, ~z$w_buff0~0=v_~z$w_buff0~0_91, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_215, ~z$w_buff0~0=v_~z$w_buff0~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, ~z$w_buff1~0=v_~z$w_buff1~0_66, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_32, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 17:24:38,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L811-2-->L811-5: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1224469002 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1224469002 256) 0)) (.cse1 (= |P3Thread1of1ForFork2_#t~ite29_Out1224469002| |P3Thread1of1ForFork2_#t~ite28_Out1224469002|))) (or (and (not .cse0) (= ~z$w_buff0~0_In1224469002 |P3Thread1of1ForFork2_#t~ite28_Out1224469002|) .cse1 (not .cse2)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out1224469002| ~z$w_buff1~0_In1224469002) (or .cse2 .cse0) .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1224469002, ~z$w_buff0~0=~z$w_buff0~0_In1224469002, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1224469002, ~z$w_buff1~0=~z$w_buff1~0_In1224469002} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1224469002|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1224469002|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1224469002, ~z$w_buff0~0=~z$w_buff0~0_In1224469002, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1224469002, ~z$w_buff1~0=~z$w_buff1~0_In1224469002} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 17:24:38,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L816-->L817: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_78} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:24:38,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In2062945109 256) 0))) (or (and (= ~z~0_In2062945109 |P3Thread1of1ForFork2_#t~ite48_Out2062945109|) .cse0) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out2062945109| ~z$mem_tmp~0_In2062945109)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In2062945109, ~z$flush_delayed~0=~z$flush_delayed~0_In2062945109, ~z~0=~z~0_In2062945109} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In2062945109, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out2062945109|, ~z$flush_delayed~0=~z$flush_delayed~0_In2062945109, ~z~0=~z~0_In2062945109} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 17:24:38,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= v_~a~0_14 1) (= v_~x~0_22 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_14, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 17:24:38,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~x~0_15 2) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_36 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_36, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 17:24:38,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1925886402 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1925886402 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out1925886402| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out1925886402| ~z$w_buff0_used~0_In1925886402)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1925886402, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1925886402} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out1925886402|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1925886402, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1925886402} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 17:24:38,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1911327882 256)))) (or (and (= ~z~0_In1911327882 |P2Thread1of1ForFork1_#t~ite25_Out1911327882|) .cse0) (and (= ~z$mem_tmp~0_In1911327882 |P2Thread1of1ForFork1_#t~ite25_Out1911327882|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1911327882, ~z$flush_delayed~0=~z$flush_delayed~0_In1911327882, ~z~0=~z~0_In1911327882} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1911327882, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out1911327882|, ~z$flush_delayed~0=~z$flush_delayed~0_In1911327882, ~z~0=~z~0_In1911327882} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 17:24:38,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L781-2-->P2EXIT: Formula: (and (= v_~z~0_127 |v_P2Thread1of1ForFork1_#t~ite25_38|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_91) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~z~0=v_~z~0_127, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:24:38,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1035489400 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1035489400 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1035489400 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1035489400 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out1035489400|)) (and (= ~z$w_buff1_used~0_In1035489400 |P3Thread1of1ForFork2_#t~ite52_Out1035489400|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1035489400, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1035489400, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1035489400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1035489400} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1035489400|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1035489400, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1035489400, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1035489400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1035489400} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 17:24:38,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L829-->L830: Formula: (let ((.cse0 (= ~z$r_buff0_thd4~0_Out1790132734 ~z$r_buff0_thd4~0_In1790132734)) (.cse2 (= (mod ~z$w_buff0_used~0_In1790132734 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1790132734 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (not .cse1) (= ~z$r_buff0_thd4~0_Out1790132734 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1790132734, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1790132734} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1790132734|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1790132734, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1790132734} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:24:38,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In655940397 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In655940397 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In655940397 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In655940397 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite54_Out655940397|)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite54_Out655940397| ~z$r_buff1_thd4~0_In655940397) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In655940397, ~z$w_buff0_used~0=~z$w_buff0_used~0_In655940397, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In655940397, ~z$w_buff1_used~0=~z$w_buff1_used~0_In655940397} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out655940397|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In655940397, ~z$w_buff0_used~0=~z$w_buff0_used~0_In655940397, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In655940397, ~z$w_buff1_used~0=~z$w_buff1_used~0_In655940397} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 17:24:38,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L830-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_141, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:24:38,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_34) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:24:38,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L861-2-->L861-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2017398457 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-2017398457 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-2017398457| |ULTIMATE.start_main_#t~ite60_Out-2017398457|))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite59_Out-2017398457| ~z~0_In-2017398457)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-2017398457| ~z$w_buff1~0_In-2017398457) (not .cse2) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2017398457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2017398457, ~z$w_buff1~0=~z$w_buff1~0_In-2017398457, ~z~0=~z~0_In-2017398457} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-2017398457|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2017398457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2017398457, ~z$w_buff1~0=~z$w_buff1~0_In-2017398457, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-2017398457|, ~z~0=~z~0_In-2017398457} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:24:38,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L862-->L862-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-50930865 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-50930865 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-50930865| ~z$w_buff0_used~0_In-50930865)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out-50930865|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-50930865, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-50930865} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-50930865, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-50930865|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-50930865} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:24:38,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L863-->L863-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In355927789 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In355927789 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In355927789 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In355927789 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out355927789| ~z$w_buff1_used~0_In355927789)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out355927789|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In355927789, ~z$w_buff0_used~0=~z$w_buff0_used~0_In355927789, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In355927789, ~z$w_buff1_used~0=~z$w_buff1_used~0_In355927789} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out355927789|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In355927789, ~z$w_buff0_used~0=~z$w_buff0_used~0_In355927789, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In355927789, ~z$w_buff1_used~0=~z$w_buff1_used~0_In355927789} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:24:38,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L864-->L864-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1998387292 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1998387292 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out1998387292| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite63_Out1998387292| ~z$r_buff0_thd0~0_In1998387292) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1998387292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998387292} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1998387292|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1998387292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998387292} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:24:38,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L865-->L865-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1164123435 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1164123435 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1164123435 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1164123435 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out-1164123435| 0)) (and (= |ULTIMATE.start_main_#t~ite64_Out-1164123435| ~z$r_buff1_thd0~0_In-1164123435) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1164123435, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1164123435, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1164123435, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164123435} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1164123435, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1164123435, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1164123435, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164123435, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1164123435|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:24:38,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_182 |v_ULTIMATE.start_main_#t~ite64_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~y~0_49 2) (= 1 v_~__unbuffered_p3_EAX~0_33) (= v_~x~0_29 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_45|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:24:38,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:24:38 BasicIcfg [2019-12-07 17:24:38,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:24:38,083 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:24:38,083 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:24:38,083 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:24:38,084 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:22:38" (3/4) ... [2019-12-07 17:24:38,085 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:24:38,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] ULTIMATE.startENTRY-->L849: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= 0 v_~x~0_105) (= 0 v_~z$flush_delayed~0_384) (= v_~z$w_buff1_used~0_989 0) (= 0 v_~__unbuffered_p2_EAX~0_146) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t573~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t573~0.base_37|) |v_ULTIMATE.start_main_~#t573~0.offset_25| 0))) (= |v_#NULL.offset_7| 0) (= 0 v_~z$mem_tmp~0_347) (= v_~z$r_buff1_thd2~0_303 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t573~0.base_37| 4) |v_#length_31|) (< 0 |v_#StackHeapBarrier_21|) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t573~0.base_37|) (= 0 v_~z$r_buff0_thd3~0_515) (= v_~z$r_buff0_thd2~0_71 0) (= v_~__unbuffered_p3_EAX~0_112 0) (= v_~z$w_buff0_used~0_1397 0) (= v_~main$tmp_guard1~0_91 0) (= v_~weak$$choice2~0_438 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_71 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t573~0.base_37|) 0) (= v_~z$r_buff1_thd0~0_430 0) (= v_~z$r_buff1_thd1~0_299 0) (= 0 v_~weak$$choice0~0_336) (= 0 |v_ULTIMATE.start_main_~#t573~0.offset_25|) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~y~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff1~0_562 0) (= 0 |v_#NULL.base_7|) (= 0 v_~__unbuffered_p3_EBX~0_93) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t573~0.base_37| 1)) (= v_~a~0_37 0) (= 0 v_~z$r_buff0_thd4~0_677) (= v_~main$tmp_guard0~0_22 0) (= v_~z~0_307 0) (= 0 v_~z$r_buff1_thd4~0_523) (= v_~z$w_buff0~0_773 0) (= v_~z$r_buff0_thd0~0_170 0) (= 0 v_~z$r_buff1_thd3~0_601))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_24|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ULTIMATE.start_main_~#t573~0.base=|v_ULTIMATE.start_main_~#t573~0.base_37|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_303, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_184|, ~a~0=v_~a~0_37, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_677, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_112, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ULTIMATE.start_main_~#t574~0.offset=|v_ULTIMATE.start_main_~#t574~0.offset_17|, ULTIMATE.start_main_~#t576~0.base=|v_ULTIMATE.start_main_~#t576~0.base_23|, ~z$mem_tmp~0=v_~z$mem_tmp~0_347, ULTIMATE.start_main_~#t576~0.offset=|v_ULTIMATE.start_main_~#t576~0.offset_18|, ULTIMATE.start_main_~#t574~0.base=|v_ULTIMATE.start_main_~#t574~0.base_30|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_989, ~z$flush_delayed~0=v_~z$flush_delayed~0_384, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~weak$$choice0~0=v_~weak$$choice0~0_336, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_409|, ULTIMATE.start_main_~#t575~0.base=|v_ULTIMATE.start_main_~#t575~0.base_22|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_299, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_515, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ~x~0=v_~x~0_105, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_523, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_562, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ULTIMATE.start_main_~#t575~0.offset=|v_ULTIMATE.start_main_~#t575~0.offset_18|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_430, ~y~0=v_~y~0_119, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1397, ~z$w_buff0~0=v_~z$w_buff0~0_773, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_601, ULTIMATE.start_main_~#t573~0.offset=|v_ULTIMATE.start_main_~#t573~0.offset_25|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_93, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_67|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_57|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_307, ~weak$$choice2~0=v_~weak$$choice2~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t573~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t574~0.offset, ULTIMATE.start_main_~#t576~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_~#t576~0.offset, ULTIMATE.start_main_~#t574~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t575~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t575~0.offset, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t573~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:24:38,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L849-1-->L851: Formula: (and (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t574~0.base_12| 4) |v_#length_21|) (not (= |v_ULTIMATE.start_main_~#t574~0.base_12| 0)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t574~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t574~0.base_12|) |v_ULTIMATE.start_main_~#t574~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t574~0.offset_10|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t574~0.base_12|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t574~0.base_12|) 0) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t574~0.base_12| 1) |v_#valid_46|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t574~0.base=|v_ULTIMATE.start_main_~#t574~0.base_12|, #length=|v_#length_21|, ULTIMATE.start_main_~#t574~0.offset=|v_ULTIMATE.start_main_~#t574~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t574~0.base, #length, ULTIMATE.start_main_~#t574~0.offset] because there is no mapped edge [2019-12-07 17:24:38,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L851-1-->L853: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t575~0.base_12|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t575~0.base_12| 4) |v_#length_19|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t575~0.base_12| 1)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t575~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t575~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t575~0.base_12|) |v_ULTIMATE.start_main_~#t575~0.offset_11| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t575~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t575~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t575~0.base=|v_ULTIMATE.start_main_~#t575~0.base_12|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t575~0.offset=|v_ULTIMATE.start_main_~#t575~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t575~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t575~0.offset] because there is no mapped edge [2019-12-07 17:24:38,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t576~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t576~0.base_13|) |v_ULTIMATE.start_main_~#t576~0.offset_11| 3)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t576~0.offset_11| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t576~0.base_13| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t576~0.base_13|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t576~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t576~0.base_13|)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t576~0.base_13| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t576~0.offset=|v_ULTIMATE.start_main_~#t576~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~#t576~0.base=|v_ULTIMATE.start_main_~#t576~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t576~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t576~0.base] because there is no mapped edge [2019-12-07 17:24:38,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_216 v_~z$w_buff1_used~0_129) (= v_~z$w_buff0~0_91 v_~z$w_buff1~0_66) (= v_P3Thread1of1ForFork2_~arg.offset_32 |v_P3Thread1of1ForFork2_#in~arg.offset_34|) (= v_~z$w_buff0_used~0_215 1) (= 1 v_~z$w_buff0~0_90) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_215 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_129 256))))) 1 0)) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 0)) (= |v_P3Thread1of1ForFork2_#in~arg.base_34| v_P3Thread1of1ForFork2_~arg.base_32) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_216, ~z$w_buff0~0=v_~z$w_buff0~0_91, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_215, ~z$w_buff0~0=v_~z$w_buff0~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, ~z$w_buff1~0=v_~z$w_buff1~0_66, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_32, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 17:24:38,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L811-2-->L811-5: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1224469002 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1224469002 256) 0)) (.cse1 (= |P3Thread1of1ForFork2_#t~ite29_Out1224469002| |P3Thread1of1ForFork2_#t~ite28_Out1224469002|))) (or (and (not .cse0) (= ~z$w_buff0~0_In1224469002 |P3Thread1of1ForFork2_#t~ite28_Out1224469002|) .cse1 (not .cse2)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out1224469002| ~z$w_buff1~0_In1224469002) (or .cse2 .cse0) .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1224469002, ~z$w_buff0~0=~z$w_buff0~0_In1224469002, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1224469002, ~z$w_buff1~0=~z$w_buff1~0_In1224469002} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1224469002|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1224469002|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1224469002, ~z$w_buff0~0=~z$w_buff0~0_In1224469002, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1224469002, ~z$w_buff1~0=~z$w_buff1~0_In1224469002} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 17:24:38,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L816-->L817: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_78} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:24:38,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In2062945109 256) 0))) (or (and (= ~z~0_In2062945109 |P3Thread1of1ForFork2_#t~ite48_Out2062945109|) .cse0) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out2062945109| ~z$mem_tmp~0_In2062945109)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In2062945109, ~z$flush_delayed~0=~z$flush_delayed~0_In2062945109, ~z~0=~z~0_In2062945109} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In2062945109, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out2062945109|, ~z$flush_delayed~0=~z$flush_delayed~0_In2062945109, ~z~0=~z~0_In2062945109} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 17:24:38,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= v_~a~0_14 1) (= v_~x~0_22 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_14, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 17:24:38,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~x~0_15 2) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_36 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_36, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 17:24:38,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1925886402 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1925886402 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out1925886402| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out1925886402| ~z$w_buff0_used~0_In1925886402)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1925886402, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1925886402} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out1925886402|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1925886402, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1925886402} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 17:24:38,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1911327882 256)))) (or (and (= ~z~0_In1911327882 |P2Thread1of1ForFork1_#t~ite25_Out1911327882|) .cse0) (and (= ~z$mem_tmp~0_In1911327882 |P2Thread1of1ForFork1_#t~ite25_Out1911327882|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1911327882, ~z$flush_delayed~0=~z$flush_delayed~0_In1911327882, ~z~0=~z~0_In1911327882} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1911327882, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out1911327882|, ~z$flush_delayed~0=~z$flush_delayed~0_In1911327882, ~z~0=~z~0_In1911327882} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 17:24:38,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L781-2-->P2EXIT: Formula: (and (= v_~z~0_127 |v_P2Thread1of1ForFork1_#t~ite25_38|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_91) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~z~0=v_~z~0_127, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:24:38,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1035489400 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1035489400 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1035489400 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1035489400 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out1035489400|)) (and (= ~z$w_buff1_used~0_In1035489400 |P3Thread1of1ForFork2_#t~ite52_Out1035489400|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1035489400, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1035489400, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1035489400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1035489400} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1035489400|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1035489400, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1035489400, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1035489400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1035489400} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 17:24:38,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L829-->L830: Formula: (let ((.cse0 (= ~z$r_buff0_thd4~0_Out1790132734 ~z$r_buff0_thd4~0_In1790132734)) (.cse2 (= (mod ~z$w_buff0_used~0_In1790132734 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1790132734 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (not .cse1) (= ~z$r_buff0_thd4~0_Out1790132734 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1790132734, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1790132734} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1790132734|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1790132734, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1790132734} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:24:38,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In655940397 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In655940397 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In655940397 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In655940397 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite54_Out655940397|)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite54_Out655940397| ~z$r_buff1_thd4~0_In655940397) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In655940397, ~z$w_buff0_used~0=~z$w_buff0_used~0_In655940397, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In655940397, ~z$w_buff1_used~0=~z$w_buff1_used~0_In655940397} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out655940397|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In655940397, ~z$w_buff0_used~0=~z$w_buff0_used~0_In655940397, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In655940397, ~z$w_buff1_used~0=~z$w_buff1_used~0_In655940397} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 17:24:38,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L830-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_141, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:24:38,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_34) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:24:38,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L861-2-->L861-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2017398457 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-2017398457 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-2017398457| |ULTIMATE.start_main_#t~ite60_Out-2017398457|))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite59_Out-2017398457| ~z~0_In-2017398457)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-2017398457| ~z$w_buff1~0_In-2017398457) (not .cse2) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2017398457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2017398457, ~z$w_buff1~0=~z$w_buff1~0_In-2017398457, ~z~0=~z~0_In-2017398457} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-2017398457|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2017398457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2017398457, ~z$w_buff1~0=~z$w_buff1~0_In-2017398457, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-2017398457|, ~z~0=~z~0_In-2017398457} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:24:38,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L862-->L862-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-50930865 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-50930865 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-50930865| ~z$w_buff0_used~0_In-50930865)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out-50930865|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-50930865, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-50930865} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-50930865, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-50930865|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-50930865} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:24:38,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L863-->L863-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In355927789 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In355927789 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In355927789 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In355927789 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out355927789| ~z$w_buff1_used~0_In355927789)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out355927789|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In355927789, ~z$w_buff0_used~0=~z$w_buff0_used~0_In355927789, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In355927789, ~z$w_buff1_used~0=~z$w_buff1_used~0_In355927789} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out355927789|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In355927789, ~z$w_buff0_used~0=~z$w_buff0_used~0_In355927789, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In355927789, ~z$w_buff1_used~0=~z$w_buff1_used~0_In355927789} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:24:38,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L864-->L864-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1998387292 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1998387292 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out1998387292| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite63_Out1998387292| ~z$r_buff0_thd0~0_In1998387292) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1998387292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998387292} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1998387292|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1998387292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998387292} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:24:38,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L865-->L865-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1164123435 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1164123435 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1164123435 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1164123435 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out-1164123435| 0)) (and (= |ULTIMATE.start_main_#t~ite64_Out-1164123435| ~z$r_buff1_thd0~0_In-1164123435) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1164123435, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1164123435, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1164123435, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164123435} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1164123435, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1164123435, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1164123435, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164123435, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1164123435|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:24:38,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_182 |v_ULTIMATE.start_main_#t~ite64_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~y~0_49 2) (= 1 v_~__unbuffered_p3_EAX~0_33) (= v_~x~0_29 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_45|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:24:38,166 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5f89edc5-587c-4e0c-8d02-f4f6e7d6d097/bin/uautomizer/witness.graphml [2019-12-07 17:24:38,167 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:24:38,168 INFO L168 Benchmark]: Toolchain (without parser) took 120611.65 ms. Allocated memory was 1.0 GB in the beginning and 8.8 GB in the end (delta: 7.8 GB). Free memory was 939.4 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 5.6 GB. Max. memory is 11.5 GB. [2019-12-07 17:24:38,168 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:24:38,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -134.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:38,168 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:38,169 INFO L168 Benchmark]: Boogie Preprocessor took 27.33 ms. Allocated memory is still 1.1 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 17:24:38,169 INFO L168 Benchmark]: RCFGBuilder took 460.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:38,169 INFO L168 Benchmark]: TraceAbstraction took 119572.88 ms. Allocated memory was 1.1 GB in the beginning and 8.8 GB in the end (delta: 7.7 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 5.5 GB. Max. memory is 11.5 GB. [2019-12-07 17:24:38,170 INFO L168 Benchmark]: Witness Printer took 83.81 ms. Allocated memory is still 8.8 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:38,171 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -134.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.33 ms. Allocated memory is still 1.1 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. * RCFGBuilder took 460.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119572.88 ms. Allocated memory was 1.1 GB in the beginning and 8.8 GB in the end (delta: 7.7 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 5.5 GB. Max. memory is 11.5 GB. * Witness Printer took 83.81 ms. Allocated memory is still 8.8 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 210 ProgramPointsBefore, 115 ProgramPointsAfterwards, 253 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 50 ConcurrentYvCompositions, 28 ChoiceCompositions, 10258 VarBasedMoverChecksPositive, 419 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 389 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 146481 CheckedPairsTotal, 131 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L849] FCALL, FORK 0 pthread_create(&t573, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t574, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t575, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t576, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L800] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L801] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L802] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L803] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = (_Bool)1 [L807] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 4 z$flush_delayed = weak$$choice2 [L810] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L812] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L813] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L814] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z = z$flush_delayed ? z$mem_tmp : z [L820] 4 z$flush_delayed = (_Bool)0 [L823] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L779] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 198 locations, 2 error locations. Result: UNSAFE, OverallTime: 119.3s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 34.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5037 SDtfs, 6254 SDslu, 10988 SDs, 0 SdLazy, 5110 SolverSat, 323 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 35 SyntacticMatches, 12 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381324occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 69.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 203047 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1020 NumberOfCodeBlocks, 1020 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 309763 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...