./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_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_7e913939-31ea-4951-96f7-9e9720839e7a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7e913939-31ea-4951-96f7-9e9720839e7a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7e913939-31ea-4951-96f7-9e9720839e7a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7e913939-31ea-4951-96f7-9e9720839e7a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7e913939-31ea-4951-96f7-9e9720839e7a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7e913939-31ea-4951-96f7-9e9720839e7a/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 81178ead616b2417129cbf2fa341748ee7ea29cd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:35:21,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:35:21,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:35:21,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:35:21,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:35:21,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:35:21,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:35:21,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:35:21,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:35:21,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:35:21,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:35:21,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:35:21,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:35:21,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:35:21,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:35:21,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:35:21,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:35:21,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:35:21,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:35:21,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:35:21,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:35:21,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:35:21,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:35:21,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:35:21,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:35:21,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:35:21,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:35:21,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:35:21,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:35:21,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:35:21,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:35:21,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:35:21,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:35:21,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:35:21,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:35:21,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:35:21,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:35:21,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:35:21,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:35:21,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:35:21,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:35:21,972 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7e913939-31ea-4951-96f7-9e9720839e7a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:35:21,981 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:35:21,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:35:21,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:35:21,982 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:35:21,982 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:35:21,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:35:21,983 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:35:21,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:35:21,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:35:21,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:35:21,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:35:21,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:35:21,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:35:21,984 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:35:21,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:35:21,984 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:35:21,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:35:21,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:35:21,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:35:21,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:35:21,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:35:21,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:35:21,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:35:21,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:35:21,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:35:21,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:35:21,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:35:21,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:35:21,985 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:35:21,985 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_7e913939-31ea-4951-96f7-9e9720839e7a/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 -> 81178ead616b2417129cbf2fa341748ee7ea29cd [2019-12-07 11:35:22,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:35:22,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:35:22,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:35:22,096 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:35:22,097 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:35:22,097 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7e913939-31ea-4951-96f7-9e9720839e7a/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix052_rmo.opt.i [2019-12-07 11:35:22,136 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7e913939-31ea-4951-96f7-9e9720839e7a/bin/uautomizer/data/50bc8feb9/d9dad34dafb646d3a3c1be213c1d3abf/FLAG7212db523 [2019-12-07 11:35:22,511 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:35:22,511 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7e913939-31ea-4951-96f7-9e9720839e7a/sv-benchmarks/c/pthread-wmm/mix052_rmo.opt.i [2019-12-07 11:35:22,525 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7e913939-31ea-4951-96f7-9e9720839e7a/bin/uautomizer/data/50bc8feb9/d9dad34dafb646d3a3c1be213c1d3abf/FLAG7212db523 [2019-12-07 11:35:22,536 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7e913939-31ea-4951-96f7-9e9720839e7a/bin/uautomizer/data/50bc8feb9/d9dad34dafb646d3a3c1be213c1d3abf [2019-12-07 11:35:22,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:35:22,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:35:22,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:35:22,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:35:22,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:35:22,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:35:22" (1/1) ... [2019-12-07 11:35:22,546 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 11:35:22, skipping insertion in model container [2019-12-07 11:35:22,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:35:22" (1/1) ... [2019-12-07 11:35:22,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:35:22,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:35:22,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:35:22,844 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:35:22,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:35:22,933 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:35:22,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:35:22 WrapperNode [2019-12-07 11:35:22,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:35:22,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:35:22,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:35:22,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:35:22,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:35:22" (1/1) ... [2019-12-07 11:35:22,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:35:22" (1/1) ... [2019-12-07 11:35:22,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:35:22,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:35:22,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:35:22,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:35:22,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:35:22" (1/1) ... [2019-12-07 11:35:22,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:35:22" (1/1) ... [2019-12-07 11:35:22,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:35:22" (1/1) ... [2019-12-07 11:35:22,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:35:22" (1/1) ... [2019-12-07 11:35:22,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:35:22" (1/1) ... [2019-12-07 11:35:22,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:35:22" (1/1) ... [2019-12-07 11:35:22,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:35:22" (1/1) ... [2019-12-07 11:35:22,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:35:22,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:35:22,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:35:22,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:35:22,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:35:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7e913939-31ea-4951-96f7-9e9720839e7a/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 11:35:23,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:35:23,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:35:23,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:35:23,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:35:23,037 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:35:23,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:35:23,037 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:35:23,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:35:23,037 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:35:23,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:35:23,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:35:23,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:35:23,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:35:23,038 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 11:35:23,358 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:35:23,358 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:35:23,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:35:23 BoogieIcfgContainer [2019-12-07 11:35:23,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:35:23,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:35:23,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:35:23,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:35:23,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:35:22" (1/3) ... [2019-12-07 11:35:23,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f09d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:35:23, skipping insertion in model container [2019-12-07 11:35:23,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:35:22" (2/3) ... [2019-12-07 11:35:23,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f09d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:35:23, skipping insertion in model container [2019-12-07 11:35:23,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:35:23" (3/3) ... [2019-12-07 11:35:23,364 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_rmo.opt.i [2019-12-07 11:35:23,370 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:35:23,370 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:35:23,375 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:35:23,375 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:35:23,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,402 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,402 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,418 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,418 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,419 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,419 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,419 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:35:23,435 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:35:23,449 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:35:23,449 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:35:23,449 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:35:23,449 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:35:23,449 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:35:23,449 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:35:23,449 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:35:23,449 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:35:23,462 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-07 11:35:23,463 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 11:35:23,520 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 11:35:23,520 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:35:23,529 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 11:35:23,540 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 11:35:23,570 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 11:35:23,570 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:35:23,574 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 11:35:23,586 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 11:35:23,586 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:35:26,154 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 11:35:26,260 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39870 [2019-12-07 11:35:26,261 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-07 11:35:26,263 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 80 transitions [2019-12-07 11:35:26,783 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12726 states. [2019-12-07 11:35:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 12726 states. [2019-12-07 11:35:26,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:35:26,790 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:26,790 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:35:26,790 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:26,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:26,794 INFO L82 PathProgramCache]: Analyzing trace with hash -534032227, now seen corresponding path program 1 times [2019-12-07 11:35:26,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:26,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132423347] [2019-12-07 11:35:26,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:26,967 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 11:35:26,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132423347] [2019-12-07 11:35:26,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:26,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:35:26,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215448786] [2019-12-07 11:35:26,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:35:26,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:26,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:35:26,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:35:26,989 INFO L87 Difference]: Start difference. First operand 12726 states. Second operand 3 states. [2019-12-07 11:35:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:27,191 INFO L93 Difference]: Finished difference Result 12374 states and 47232 transitions. [2019-12-07 11:35:27,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:35:27,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 11:35:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:27,282 INFO L225 Difference]: With dead ends: 12374 [2019-12-07 11:35:27,282 INFO L226 Difference]: Without dead ends: 11654 [2019-12-07 11:35:27,283 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 11:35:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11654 states. [2019-12-07 11:35:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11654 to 11654. [2019-12-07 11:35:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11654 states. [2019-12-07 11:35:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11654 states to 11654 states and 44412 transitions. [2019-12-07 11:35:27,747 INFO L78 Accepts]: Start accepts. Automaton has 11654 states and 44412 transitions. Word has length 7 [2019-12-07 11:35:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:27,748 INFO L462 AbstractCegarLoop]: Abstraction has 11654 states and 44412 transitions. [2019-12-07 11:35:27,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:35:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 11654 states and 44412 transitions. [2019-12-07 11:35:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:35:27,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:27,752 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:35:27,752 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:27,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:27,752 INFO L82 PathProgramCache]: Analyzing trace with hash 633204052, now seen corresponding path program 1 times [2019-12-07 11:35:27,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:27,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574181770] [2019-12-07 11:35:27,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:27,813 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 11:35:27,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574181770] [2019-12-07 11:35:27,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:27,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:35:27,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900389951] [2019-12-07 11:35:27,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:35:27,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:27,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:35:27,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:35:27,815 INFO L87 Difference]: Start difference. First operand 11654 states and 44412 transitions. Second operand 4 states. [2019-12-07 11:35:28,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:28,042 INFO L93 Difference]: Finished difference Result 17566 states and 64596 transitions. [2019-12-07 11:35:28,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:35:28,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:35:28,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:28,097 INFO L225 Difference]: With dead ends: 17566 [2019-12-07 11:35:28,097 INFO L226 Difference]: Without dead ends: 17538 [2019-12-07 11:35:28,098 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 11:35:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17538 states. [2019-12-07 11:35:28,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17538 to 15872. [2019-12-07 11:35:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15872 states. [2019-12-07 11:35:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15872 states to 15872 states and 59183 transitions. [2019-12-07 11:35:28,557 INFO L78 Accepts]: Start accepts. Automaton has 15872 states and 59183 transitions. Word has length 13 [2019-12-07 11:35:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:28,557 INFO L462 AbstractCegarLoop]: Abstraction has 15872 states and 59183 transitions. [2019-12-07 11:35:28,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:35:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 15872 states and 59183 transitions. [2019-12-07 11:35:28,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:35:28,564 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:28,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:35:28,565 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:28,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1912379884, now seen corresponding path program 1 times [2019-12-07 11:35:28,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:28,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973407593] [2019-12-07 11:35:28,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:35:28,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973407593] [2019-12-07 11:35:28,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:28,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:35:28,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017683300] [2019-12-07 11:35:28,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:35:28,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:35:28,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:35:28,612 INFO L87 Difference]: Start difference. First operand 15872 states and 59183 transitions. Second operand 4 states. [2019-12-07 11:35:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:28,769 INFO L93 Difference]: Finished difference Result 20884 states and 77167 transitions. [2019-12-07 11:35:28,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:35:28,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:35:28,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:28,806 INFO L225 Difference]: With dead ends: 20884 [2019-12-07 11:35:28,806 INFO L226 Difference]: Without dead ends: 20858 [2019-12-07 11:35:28,806 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 11:35:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20858 states. [2019-12-07 11:35:29,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20858 to 18074. [2019-12-07 11:35:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18074 states. [2019-12-07 11:35:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18074 states to 18074 states and 67346 transitions. [2019-12-07 11:35:29,175 INFO L78 Accepts]: Start accepts. Automaton has 18074 states and 67346 transitions. Word has length 16 [2019-12-07 11:35:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:29,176 INFO L462 AbstractCegarLoop]: Abstraction has 18074 states and 67346 transitions. [2019-12-07 11:35:29,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:35:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 18074 states and 67346 transitions. [2019-12-07 11:35:29,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:35:29,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:29,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:35:29,179 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:29,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1912467552, now seen corresponding path program 1 times [2019-12-07 11:35:29,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:29,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237561955] [2019-12-07 11:35:29,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:29,222 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 11:35:29,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237561955] [2019-12-07 11:35:29,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:29,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:35:29,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231840893] [2019-12-07 11:35:29,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:35:29,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:29,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:35:29,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:35:29,224 INFO L87 Difference]: Start difference. First operand 18074 states and 67346 transitions. Second operand 4 states. [2019-12-07 11:35:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:29,456 INFO L93 Difference]: Finished difference Result 22456 states and 83013 transitions. [2019-12-07 11:35:29,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:35:29,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:35:29,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:29,500 INFO L225 Difference]: With dead ends: 22456 [2019-12-07 11:35:29,500 INFO L226 Difference]: Without dead ends: 22430 [2019-12-07 11:35:29,500 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 11:35:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22430 states. [2019-12-07 11:35:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22430 to 17846. [2019-12-07 11:35:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17846 states. [2019-12-07 11:35:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17846 states to 17846 states and 66430 transitions. [2019-12-07 11:35:29,861 INFO L78 Accepts]: Start accepts. Automaton has 17846 states and 66430 transitions. Word has length 16 [2019-12-07 11:35:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:29,861 INFO L462 AbstractCegarLoop]: Abstraction has 17846 states and 66430 transitions. [2019-12-07 11:35:29,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:35:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 17846 states and 66430 transitions. [2019-12-07 11:35:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:35:29,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:29,866 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 11:35:29,866 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:29,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash -478811358, now seen corresponding path program 1 times [2019-12-07 11:35:29,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:29,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11185976] [2019-12-07 11:35:29,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:29,905 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 11:35:29,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11185976] [2019-12-07 11:35:29,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:29,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:35:29,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711923990] [2019-12-07 11:35:29,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:35:29,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:29,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:35:29,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:35:29,907 INFO L87 Difference]: Start difference. First operand 17846 states and 66430 transitions. Second operand 3 states. [2019-12-07 11:35:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:29,964 INFO L93 Difference]: Finished difference Result 17821 states and 66331 transitions. [2019-12-07 11:35:29,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:35:29,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:35:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:30,003 INFO L225 Difference]: With dead ends: 17821 [2019-12-07 11:35:30,003 INFO L226 Difference]: Without dead ends: 17821 [2019-12-07 11:35:30,003 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 11:35:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17821 states. [2019-12-07 11:35:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17821 to 17821. [2019-12-07 11:35:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17821 states. [2019-12-07 11:35:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17821 states to 17821 states and 66331 transitions. [2019-12-07 11:35:30,425 INFO L78 Accepts]: Start accepts. Automaton has 17821 states and 66331 transitions. Word has length 18 [2019-12-07 11:35:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:30,425 INFO L462 AbstractCegarLoop]: Abstraction has 17821 states and 66331 transitions. [2019-12-07 11:35:30,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:35:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 17821 states and 66331 transitions. [2019-12-07 11:35:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:35:30,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:30,430 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 11:35:30,430 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:30,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:30,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1662641865, now seen corresponding path program 1 times [2019-12-07 11:35:30,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:30,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422220142] [2019-12-07 11:35:30,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:30,456 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 11:35:30,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422220142] [2019-12-07 11:35:30,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:30,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:35:30,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709265892] [2019-12-07 11:35:30,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:35:30,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:30,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:35:30,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:35:30,458 INFO L87 Difference]: Start difference. First operand 17821 states and 66331 transitions. Second operand 3 states. [2019-12-07 11:35:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:30,491 INFO L93 Difference]: Finished difference Result 10385 states and 33748 transitions. [2019-12-07 11:35:30,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:35:30,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 11:35:30,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:30,505 INFO L225 Difference]: With dead ends: 10385 [2019-12-07 11:35:30,505 INFO L226 Difference]: Without dead ends: 10385 [2019-12-07 11:35:30,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:35:30,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10385 states. [2019-12-07 11:35:30,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10385 to 10385. [2019-12-07 11:35:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10385 states. [2019-12-07 11:35:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10385 states to 10385 states and 33748 transitions. [2019-12-07 11:35:30,656 INFO L78 Accepts]: Start accepts. Automaton has 10385 states and 33748 transitions. Word has length 19 [2019-12-07 11:35:30,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:30,656 INFO L462 AbstractCegarLoop]: Abstraction has 10385 states and 33748 transitions. [2019-12-07 11:35:30,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:35:30,656 INFO L276 IsEmpty]: Start isEmpty. Operand 10385 states and 33748 transitions. [2019-12-07 11:35:30,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:35:30,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:30,659 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 11:35:30,659 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:30,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:30,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1546176597, now seen corresponding path program 1 times [2019-12-07 11:35:30,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:30,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903602679] [2019-12-07 11:35:30,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:30,686 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 11:35:30,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903602679] [2019-12-07 11:35:30,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:30,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:35:30,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741817668] [2019-12-07 11:35:30,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:35:30,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:30,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:35:30,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:35:30,688 INFO L87 Difference]: Start difference. First operand 10385 states and 33748 transitions. Second operand 4 states. [2019-12-07 11:35:30,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:30,706 INFO L93 Difference]: Finished difference Result 2088 states and 5552 transitions. [2019-12-07 11:35:30,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:35:30,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 11:35:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:30,709 INFO L225 Difference]: With dead ends: 2088 [2019-12-07 11:35:30,709 INFO L226 Difference]: Without dead ends: 2088 [2019-12-07 11:35:30,709 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 11:35:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2019-12-07 11:35:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2088. [2019-12-07 11:35:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-12-07 11:35:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 5552 transitions. [2019-12-07 11:35:30,736 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 5552 transitions. Word has length 19 [2019-12-07 11:35:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:30,736 INFO L462 AbstractCegarLoop]: Abstraction has 2088 states and 5552 transitions. [2019-12-07 11:35:30,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:35:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 5552 transitions. [2019-12-07 11:35:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:35:30,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:30,738 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] [2019-12-07 11:35:30,738 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:30,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:30,738 INFO L82 PathProgramCache]: Analyzing trace with hash 941915908, now seen corresponding path program 1 times [2019-12-07 11:35:30,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:30,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358706259] [2019-12-07 11:35:30,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:30,790 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 11:35:30,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358706259] [2019-12-07 11:35:30,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:30,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:35:30,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189089265] [2019-12-07 11:35:30,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:35:30,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:30,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:35:30,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:35:30,791 INFO L87 Difference]: Start difference. First operand 2088 states and 5552 transitions. Second operand 5 states. [2019-12-07 11:35:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:31,033 INFO L93 Difference]: Finished difference Result 3138 states and 8203 transitions. [2019-12-07 11:35:31,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:35:31,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 11:35:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:31,036 INFO L225 Difference]: With dead ends: 3138 [2019-12-07 11:35:31,037 INFO L226 Difference]: Without dead ends: 3138 [2019-12-07 11:35:31,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:35:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2019-12-07 11:35:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2628. [2019-12-07 11:35:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2628 states. [2019-12-07 11:35:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 6941 transitions. [2019-12-07 11:35:31,066 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 6941 transitions. Word has length 29 [2019-12-07 11:35:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:31,066 INFO L462 AbstractCegarLoop]: Abstraction has 2628 states and 6941 transitions. [2019-12-07 11:35:31,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:35:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 6941 transitions. [2019-12-07 11:35:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:35:31,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:31,069 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] [2019-12-07 11:35:31,069 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:31,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:31,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1752215634, now seen corresponding path program 1 times [2019-12-07 11:35:31,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:31,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537989316] [2019-12-07 11:35:31,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:31,101 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 11:35:31,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537989316] [2019-12-07 11:35:31,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:31,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:35:31,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864925360] [2019-12-07 11:35:31,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:35:31,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:31,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:35:31,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:35:31,103 INFO L87 Difference]: Start difference. First operand 2628 states and 6941 transitions. Second operand 3 states. [2019-12-07 11:35:31,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:31,134 INFO L93 Difference]: Finished difference Result 3598 states and 9380 transitions. [2019-12-07 11:35:31,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:35:31,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 11:35:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:31,138 INFO L225 Difference]: With dead ends: 3598 [2019-12-07 11:35:31,138 INFO L226 Difference]: Without dead ends: 3598 [2019-12-07 11:35:31,138 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 11:35:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2019-12-07 11:35:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 2832. [2019-12-07 11:35:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2832 states. [2019-12-07 11:35:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 7444 transitions. [2019-12-07 11:35:31,167 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 7444 transitions. Word has length 29 [2019-12-07 11:35:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:31,167 INFO L462 AbstractCegarLoop]: Abstraction has 2832 states and 7444 transitions. [2019-12-07 11:35:31,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:35:31,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 7444 transitions. [2019-12-07 11:35:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:35:31,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:31,170 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] [2019-12-07 11:35:31,170 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:31,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:31,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1147773388, now seen corresponding path program 1 times [2019-12-07 11:35:31,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:31,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14159560] [2019-12-07 11:35:31,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:31,212 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 11:35:31,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14159560] [2019-12-07 11:35:31,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:31,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:35:31,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813897310] [2019-12-07 11:35:31,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:35:31,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:31,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:35:31,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:35:31,213 INFO L87 Difference]: Start difference. First operand 2832 states and 7444 transitions. Second operand 5 states. [2019-12-07 11:35:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:31,323 INFO L93 Difference]: Finished difference Result 3578 states and 9221 transitions. [2019-12-07 11:35:31,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:35:31,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 11:35:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:31,327 INFO L225 Difference]: With dead ends: 3578 [2019-12-07 11:35:31,327 INFO L226 Difference]: Without dead ends: 3576 [2019-12-07 11:35:31,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 11:35:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3576 states. [2019-12-07 11:35:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3576 to 2988. [2019-12-07 11:35:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-12-07 11:35:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 7836 transitions. [2019-12-07 11:35:31,357 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 7836 transitions. Word has length 29 [2019-12-07 11:35:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:31,357 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 7836 transitions. [2019-12-07 11:35:31,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:35:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 7836 transitions. [2019-12-07 11:35:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:35:31,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:31,360 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] [2019-12-07 11:35:31,360 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:31,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:31,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1335383201, now seen corresponding path program 1 times [2019-12-07 11:35:31,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:31,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278654959] [2019-12-07 11:35:31,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:31,386 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 11:35:31,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278654959] [2019-12-07 11:35:31,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:31,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:35:31,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265378752] [2019-12-07 11:35:31,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:35:31,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:31,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:35:31,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:35:31,387 INFO L87 Difference]: Start difference. First operand 2988 states and 7836 transitions. Second operand 3 states. [2019-12-07 11:35:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:31,415 INFO L93 Difference]: Finished difference Result 3732 states and 9547 transitions. [2019-12-07 11:35:31,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:35:31,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 11:35:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:31,418 INFO L225 Difference]: With dead ends: 3732 [2019-12-07 11:35:31,418 INFO L226 Difference]: Without dead ends: 3732 [2019-12-07 11:35:31,419 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 11:35:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3732 states. [2019-12-07 11:35:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3732 to 3128. [2019-12-07 11:35:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2019-12-07 11:35:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 7981 transitions. [2019-12-07 11:35:31,449 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 7981 transitions. Word has length 29 [2019-12-07 11:35:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:31,449 INFO L462 AbstractCegarLoop]: Abstraction has 3128 states and 7981 transitions. [2019-12-07 11:35:31,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:35:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 7981 transitions. [2019-12-07 11:35:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:35:31,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:31,452 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] [2019-12-07 11:35:31,452 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:31,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1151858610, now seen corresponding path program 1 times [2019-12-07 11:35:31,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:31,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732561780] [2019-12-07 11:35:31,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:31,530 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 11:35:31,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732561780] [2019-12-07 11:35:31,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:31,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:35:31,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686677895] [2019-12-07 11:35:31,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:35:31,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:31,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:35:31,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:35:31,531 INFO L87 Difference]: Start difference. First operand 3128 states and 7981 transitions. Second operand 3 states. [2019-12-07 11:35:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:31,547 INFO L93 Difference]: Finished difference Result 5110 states and 12521 transitions. [2019-12-07 11:35:31,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:35:31,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 11:35:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:31,550 INFO L225 Difference]: With dead ends: 5110 [2019-12-07 11:35:31,550 INFO L226 Difference]: Without dead ends: 3221 [2019-12-07 11:35:31,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:35:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2019-12-07 11:35:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3127. [2019-12-07 11:35:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2019-12-07 11:35:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 7017 transitions. [2019-12-07 11:35:31,579 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 7017 transitions. Word has length 30 [2019-12-07 11:35:31,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:31,580 INFO L462 AbstractCegarLoop]: Abstraction has 3127 states and 7017 transitions. [2019-12-07 11:35:31,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:35:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 7017 transitions. [2019-12-07 11:35:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:35:31,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:31,583 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] [2019-12-07 11:35:31,583 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:31,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1073342184, now seen corresponding path program 1 times [2019-12-07 11:35:31,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:31,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097184394] [2019-12-07 11:35:31,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:31,617 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 11:35:31,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097184394] [2019-12-07 11:35:31,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:31,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:35:31,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197771419] [2019-12-07 11:35:31,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:35:31,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:31,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:35:31,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:35:31,619 INFO L87 Difference]: Start difference. First operand 3127 states and 7017 transitions. Second operand 5 states. [2019-12-07 11:35:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:31,737 INFO L93 Difference]: Finished difference Result 3701 states and 8256 transitions. [2019-12-07 11:35:31,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:35:31,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 11:35:31,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:31,740 INFO L225 Difference]: With dead ends: 3701 [2019-12-07 11:35:31,740 INFO L226 Difference]: Without dead ends: 3623 [2019-12-07 11:35:31,740 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 11:35:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2019-12-07 11:35:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3000. [2019-12-07 11:35:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3000 states. [2019-12-07 11:35:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 6699 transitions. [2019-12-07 11:35:31,766 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 6699 transitions. Word has length 30 [2019-12-07 11:35:31,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:31,767 INFO L462 AbstractCegarLoop]: Abstraction has 3000 states and 6699 transitions. [2019-12-07 11:35:31,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:35:31,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 6699 transitions. [2019-12-07 11:35:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:35:31,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:31,769 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:35:31,769 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:31,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:31,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1052270197, now seen corresponding path program 1 times [2019-12-07 11:35:31,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:31,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293115001] [2019-12-07 11:35:31,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:31,809 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 11:35:31,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293115001] [2019-12-07 11:35:31,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:31,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:35:31,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230903695] [2019-12-07 11:35:31,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:35:31,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:31,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:35:31,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:35:31,811 INFO L87 Difference]: Start difference. First operand 3000 states and 6699 transitions. Second operand 5 states. [2019-12-07 11:35:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:31,834 INFO L93 Difference]: Finished difference Result 1940 states and 4102 transitions. [2019-12-07 11:35:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:35:31,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 11:35:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:31,835 INFO L225 Difference]: With dead ends: 1940 [2019-12-07 11:35:31,835 INFO L226 Difference]: Without dead ends: 1066 [2019-12-07 11:35:31,835 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 11:35:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-12-07 11:35:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 956. [2019-12-07 11:35:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-07 11:35:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2008 transitions. [2019-12-07 11:35:31,844 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2008 transitions. Word has length 31 [2019-12-07 11:35:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:31,844 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2008 transitions. [2019-12-07 11:35:31,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:35:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2008 transitions. [2019-12-07 11:35:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 11:35:31,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:31,845 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] [2019-12-07 11:35:31,845 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:31,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:31,845 INFO L82 PathProgramCache]: Analyzing trace with hash 733117723, now seen corresponding path program 1 times [2019-12-07 11:35:31,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:31,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628170651] [2019-12-07 11:35:31,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:31,891 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 11:35:31,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628170651] [2019-12-07 11:35:31,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:31,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:35:31,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978372560] [2019-12-07 11:35:31,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:35:31,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:31,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:35:31,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:35:31,893 INFO L87 Difference]: Start difference. First operand 956 states and 2008 transitions. Second operand 6 states. [2019-12-07 11:35:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:32,183 INFO L93 Difference]: Finished difference Result 1209 states and 2489 transitions. [2019-12-07 11:35:32,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:35:32,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-07 11:35:32,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:32,184 INFO L225 Difference]: With dead ends: 1209 [2019-12-07 11:35:32,184 INFO L226 Difference]: Without dead ends: 1209 [2019-12-07 11:35:32,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:35:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-12-07 11:35:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 973. [2019-12-07 11:35:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-12-07 11:35:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 2042 transitions. [2019-12-07 11:35:32,193 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 2042 transitions. Word has length 44 [2019-12-07 11:35:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:32,193 INFO L462 AbstractCegarLoop]: Abstraction has 973 states and 2042 transitions. [2019-12-07 11:35:32,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:35:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 2042 transitions. [2019-12-07 11:35:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 11:35:32,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:32,194 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] [2019-12-07 11:35:32,194 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:32,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash -137489769, now seen corresponding path program 2 times [2019-12-07 11:35:32,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:32,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349860087] [2019-12-07 11:35:32,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:32,224 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 11:35:32,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349860087] [2019-12-07 11:35:32,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:32,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:35:32,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988835894] [2019-12-07 11:35:32,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:35:32,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:32,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:35:32,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:35:32,226 INFO L87 Difference]: Start difference. First operand 973 states and 2042 transitions. Second operand 3 states. [2019-12-07 11:35:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:32,236 INFO L93 Difference]: Finished difference Result 971 states and 2037 transitions. [2019-12-07 11:35:32,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:35:32,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 11:35:32,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:32,237 INFO L225 Difference]: With dead ends: 971 [2019-12-07 11:35:32,237 INFO L226 Difference]: Without dead ends: 971 [2019-12-07 11:35:32,237 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 11:35:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-12-07 11:35:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 837. [2019-12-07 11:35:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-12-07 11:35:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1780 transitions. [2019-12-07 11:35:32,245 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1780 transitions. Word has length 44 [2019-12-07 11:35:32,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:32,245 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1780 transitions. [2019-12-07 11:35:32,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:35:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1780 transitions. [2019-12-07 11:35:32,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:35:32,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:32,246 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] [2019-12-07 11:35:32,246 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:32,246 INFO L82 PathProgramCache]: Analyzing trace with hash 965332247, now seen corresponding path program 1 times [2019-12-07 11:35:32,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:32,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092436589] [2019-12-07 11:35:32,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:32,443 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 11:35:32,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092436589] [2019-12-07 11:35:32,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:32,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:35:32,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887756096] [2019-12-07 11:35:32,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:35:32,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:32,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:35:32,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:35:32,445 INFO L87 Difference]: Start difference. First operand 837 states and 1780 transitions. Second operand 12 states. [2019-12-07 11:35:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:33,626 INFO L93 Difference]: Finished difference Result 2267 states and 4626 transitions. [2019-12-07 11:35:33,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 11:35:33,626 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-12-07 11:35:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:33,627 INFO L225 Difference]: With dead ends: 2267 [2019-12-07 11:35:33,627 INFO L226 Difference]: Without dead ends: 1303 [2019-12-07 11:35:33,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 11:35:33,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2019-12-07 11:35:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 880. [2019-12-07 11:35:33,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-12-07 11:35:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1878 transitions. [2019-12-07 11:35:33,635 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1878 transitions. Word has length 45 [2019-12-07 11:35:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:33,635 INFO L462 AbstractCegarLoop]: Abstraction has 880 states and 1878 transitions. [2019-12-07 11:35:33,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:35:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1878 transitions. [2019-12-07 11:35:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:35:33,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:33,637 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] [2019-12-07 11:35:33,637 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:33,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:33,637 INFO L82 PathProgramCache]: Analyzing trace with hash 711088023, now seen corresponding path program 2 times [2019-12-07 11:35:33,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:33,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034691385] [2019-12-07 11:35:33,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:33,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 11:35:33,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034691385] [2019-12-07 11:35:33,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:33,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:35:33,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210036005] [2019-12-07 11:35:33,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:35:33,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:33,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:35:33,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:35:33,826 INFO L87 Difference]: Start difference. First operand 880 states and 1878 transitions. Second operand 12 states. [2019-12-07 11:35:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:34,735 INFO L93 Difference]: Finished difference Result 1645 states and 3375 transitions. [2019-12-07 11:35:34,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 11:35:34,736 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-12-07 11:35:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:34,737 INFO L225 Difference]: With dead ends: 1645 [2019-12-07 11:35:34,737 INFO L226 Difference]: Without dead ends: 1304 [2019-12-07 11:35:34,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:35:34,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2019-12-07 11:35:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 881. [2019-12-07 11:35:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-12-07 11:35:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1879 transitions. [2019-12-07 11:35:34,745 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1879 transitions. Word has length 45 [2019-12-07 11:35:34,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:34,745 INFO L462 AbstractCegarLoop]: Abstraction has 881 states and 1879 transitions. [2019-12-07 11:35:34,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:35:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1879 transitions. [2019-12-07 11:35:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:35:34,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:34,746 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] [2019-12-07 11:35:34,746 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:34,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:34,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1081537617, now seen corresponding path program 3 times [2019-12-07 11:35:34,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:34,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871755939] [2019-12-07 11:35:34,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:34,933 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 11:35:34,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871755939] [2019-12-07 11:35:34,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:34,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 11:35:34,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475832970] [2019-12-07 11:35:34,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:35:34,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:34,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:35:34,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:35:34,934 INFO L87 Difference]: Start difference. First operand 881 states and 1879 transitions. Second operand 13 states. [2019-12-07 11:35:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:35,705 INFO L93 Difference]: Finished difference Result 1476 states and 3042 transitions. [2019-12-07 11:35:35,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 11:35:35,706 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-12-07 11:35:35,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:35,707 INFO L225 Difference]: With dead ends: 1476 [2019-12-07 11:35:35,707 INFO L226 Difference]: Without dead ends: 1303 [2019-12-07 11:35:35,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:35:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2019-12-07 11:35:35,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 880. [2019-12-07 11:35:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-12-07 11:35:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1877 transitions. [2019-12-07 11:35:35,715 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1877 transitions. Word has length 45 [2019-12-07 11:35:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:35,715 INFO L462 AbstractCegarLoop]: Abstraction has 880 states and 1877 transitions. [2019-12-07 11:35:35,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:35:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1877 transitions. [2019-12-07 11:35:35,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:35:35,716 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:35,716 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] [2019-12-07 11:35:35,716 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:35,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:35,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1218270701, now seen corresponding path program 4 times [2019-12-07 11:35:35,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:35,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194675953] [2019-12-07 11:35:35,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:35,757 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 11:35:35,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194675953] [2019-12-07 11:35:35,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:35,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:35:35,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327907343] [2019-12-07 11:35:35,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:35:35,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:35:35,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:35:35,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:35:35,758 INFO L87 Difference]: Start difference. First operand 880 states and 1877 transitions. Second operand 7 states. [2019-12-07 11:35:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:35,891 INFO L93 Difference]: Finished difference Result 1822 states and 3745 transitions. [2019-12-07 11:35:35,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:35:35,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-07 11:35:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:35,892 INFO L225 Difference]: With dead ends: 1822 [2019-12-07 11:35:35,892 INFO L226 Difference]: Without dead ends: 1326 [2019-12-07 11:35:35,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:35:35,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-12-07 11:35:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 885. [2019-12-07 11:35:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-12-07 11:35:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1881 transitions. [2019-12-07 11:35:35,901 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1881 transitions. Word has length 45 [2019-12-07 11:35:35,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:35,901 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 1881 transitions. [2019-12-07 11:35:35,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:35:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1881 transitions. [2019-12-07 11:35:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:35:35,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:35,902 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] [2019-12-07 11:35:35,902 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:35,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:35,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1361037591, now seen corresponding path program 5 times [2019-12-07 11:35:35,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:35:35,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470592327] [2019-12-07 11:35:35,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:35:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:35:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:35:35,958 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:35:35,958 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:35:35,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$w_buff1_used~0_392 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1400~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1400~0.base_31|) |v_ULTIMATE.start_main_~#t1400~0.offset_23| 0)) |v_#memory_int_17|) (= v_~x~0_45 0) (= v_~y$mem_tmp~0_16 0) (= |v_ULTIMATE.start_main_~#t1400~0.offset_23| 0) (= 0 v_~y$r_buff1_thd1~0_88) (= v_~weak$$choice2~0_148 0) (= v_~y$r_buff0_thd1~0_34 0) (= v_~y$w_buff0_used~0_595 0) (= v_~y$r_buff1_thd0~0_147 0) (= 0 v_~y$flush_delayed~0_39) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$r_buff0_thd3~0_173) (= v_~y$r_buff0_thd0~0_94 0) (= 0 v_~__unbuffered_p2_EAX~0_109) (= 0 v_~y$r_buff0_thd2~0_289) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1400~0.base_31|)) (= v_~y$w_buff1~0_216 0) (= v_~z~0_45 0) (= 0 v_~y$w_buff0~0_304) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1400~0.base_31|) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= v_~y~0_127 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1400~0.base_31| 4)) (= v_~main$tmp_guard0~0_20 0) (= v_~y$read_delayed~0_5 0) (= v_~main$tmp_guard1~0_32 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1400~0.base_31| 1) |v_#valid_62|) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff1_thd2~0_268) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd3~0_150) (= 0 v_~__unbuffered_cnt~0_97) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t1400~0.base=|v_ULTIMATE.start_main_~#t1400~0.base_31|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_150, ULTIMATE.start_main_~#t1400~0.offset=|v_ULTIMATE.start_main_~#t1400~0.offset_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_34, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_~#t1402~0.base=|v_ULTIMATE.start_main_~#t1402~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_65|, ULTIMATE.start_main_~#t1401~0.base=|v_ULTIMATE.start_main_~#t1401~0.base_29|, ~y$w_buff1~0=v_~y$w_buff1~0_216, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_289, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~x~0=v_~x~0_45, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_595, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t1401~0.offset=|v_ULTIMATE.start_main_~#t1401~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ~y$w_buff0~0=v_~y$w_buff0~0_304, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~y~0=v_~y~0_127, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_268, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1402~0.offset=|v_ULTIMATE.start_main_~#t1402~0.offset_15|, ~z~0=v_~z~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1400~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1401~0.offset, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t1400~0.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1402~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1401~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ULTIMATE.start_main_~#t1402~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:35:35,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L810-1-->L812: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1401~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1401~0.base_9| 0)) (= 0 |v_ULTIMATE.start_main_~#t1401~0.offset_9|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1401~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1401~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1401~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1401~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1401~0.base_9|) |v_ULTIMATE.start_main_~#t1401~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1401~0.base=|v_ULTIMATE.start_main_~#t1401~0.base_9|, ULTIMATE.start_main_~#t1401~0.offset=|v_ULTIMATE.start_main_~#t1401~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1401~0.base, ULTIMATE.start_main_~#t1401~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 11:35:35,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L812-1-->L814: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1402~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t1402~0.base_10| 0)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1402~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1402~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1402~0.base_10|) |v_ULTIMATE.start_main_~#t1402~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1402~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1402~0.offset_9|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1402~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1402~0.offset=|v_ULTIMATE.start_main_~#t1402~0.offset_9|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1402~0.base=|v_ULTIMATE.start_main_~#t1402~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t1402~0.offset, #length, ULTIMATE.start_main_~#t1402~0.base] because there is no mapped edge [2019-12-07 11:35:35,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L4-->L787: Formula: (and (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_26) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_4) (= v_~y$r_buff0_thd3~0_25 1) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18)) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_26 v_~y$r_buff1_thd3~0_26)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~z~0=v_~z~0_4} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_4, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:35:35,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_32 1) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= v_~x~0_16 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z~0=v_~z~0_32, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_16, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 11:35:35,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L752-->L752-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-681835849 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite8_Out-681835849| |P1Thread1of1ForFork1_#t~ite9_Out-681835849|) (= ~y$w_buff0~0_In-681835849 |P1Thread1of1ForFork1_#t~ite8_Out-681835849|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-681835849 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-681835849 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-681835849 256))) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In-681835849 256) 0)))) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite8_In-681835849| |P1Thread1of1ForFork1_#t~ite8_Out-681835849|) (= ~y$w_buff0~0_In-681835849 |P1Thread1of1ForFork1_#t~ite9_Out-681835849|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-681835849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-681835849, ~y$w_buff0~0=~y$w_buff0~0_In-681835849, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-681835849, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-681835849|, ~weak$$choice2~0=~weak$$choice2~0_In-681835849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681835849} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-681835849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-681835849, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-681835849|, ~y$w_buff0~0=~y$w_buff0~0_In-681835849, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-681835849, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-681835849|, ~weak$$choice2~0=~weak$$choice2~0_In-681835849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681835849} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 11:35:35,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L753-->L753-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1861724792 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite12_Out1861724792| ~y$w_buff1~0_In1861724792) (= |P1Thread1of1ForFork1_#t~ite11_In1861724792| |P1Thread1of1ForFork1_#t~ite11_Out1861724792|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite12_Out1861724792| |P1Thread1of1ForFork1_#t~ite11_Out1861724792|) (= ~y$w_buff1~0_In1861724792 |P1Thread1of1ForFork1_#t~ite11_Out1861724792|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1861724792 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1861724792 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1861724792 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1861724792 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1861724792, ~y$w_buff1~0=~y$w_buff1~0_In1861724792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1861724792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1861724792, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In1861724792|, ~weak$$choice2~0=~weak$$choice2~0_In1861724792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1861724792} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1861724792, ~y$w_buff1~0=~y$w_buff1~0_In1861724792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1861724792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1861724792, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1861724792|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1861724792|, ~weak$$choice2~0=~weak$$choice2~0_In1861724792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1861724792} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 11:35:35,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L756-->L757: Formula: (and (= v_~y$r_buff0_thd2~0_124 v_~y$r_buff0_thd2~0_123) (not (= (mod v_~weak$$choice2~0_36 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_36} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_123, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_36} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:35:35,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L759-->L767: Formula: (and (= v_~__unbuffered_cnt~0_24 (+ v_~__unbuffered_cnt~0_25 1)) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_33 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y~0=v_~y~0_33, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 11:35:35,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-165427219 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-165427219 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out-165427219| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out-165427219| ~y$w_buff0_used~0_In-165427219)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-165427219, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-165427219} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-165427219, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-165427219, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-165427219|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 11:35:35,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1756559810 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1756559810 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1756559810 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1756559810 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite29_Out1756559810| ~y$w_buff1_used~0_In1756559810)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1756559810|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1756559810, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1756559810, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1756559810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1756559810} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1756559810, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1756559810, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1756559810, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1756559810|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1756559810} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 11:35:35,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L790-->L791: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In1105449863 ~y$r_buff0_thd3~0_Out1105449863)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1105449863 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1105449863 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~y$r_buff0_thd3~0_Out1105449863) (not .cse1) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1105449863, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1105449863} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1105449863, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1105449863|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1105449863} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:35:35,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1447049678 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1447049678 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1447049678 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1447049678 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1447049678 |P2Thread1of1ForFork2_#t~ite31_Out1447049678|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out1447049678|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1447049678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1447049678, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447049678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1447049678} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1447049678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1447049678, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1447049678|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447049678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1447049678} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 11:35:35,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_57) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 11:35:35,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L814-1-->L820: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_23) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:35:35,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L820-2-->L820-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In831808684 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In831808684 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out831808684| ~y$w_buff1~0_In831808684)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out831808684| ~y~0_In831808684)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In831808684, ~y~0=~y~0_In831808684, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In831808684, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831808684} OutVars{~y$w_buff1~0=~y$w_buff1~0_In831808684, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out831808684|, ~y~0=~y~0_In831808684, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In831808684, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831808684} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 11:35:35,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L820-4-->L821: Formula: (= v_~y~0_26 |v_ULTIMATE.start_main_#t~ite35_14|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 11:35:35,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1778593280 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1778593280 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1778593280 |ULTIMATE.start_main_#t~ite37_Out1778593280|)) (and (= |ULTIMATE.start_main_#t~ite37_Out1778593280| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1778593280, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1778593280} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1778593280, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1778593280, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1778593280|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:35:35,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2128283667 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2128283667 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2128283667 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In2128283667 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out2128283667| ~y$w_buff1_used~0_In2128283667)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out2128283667| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2128283667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2128283667, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2128283667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2128283667} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2128283667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2128283667, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out2128283667|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2128283667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2128283667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 11:35:35,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1748453422 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1748453422 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-1748453422| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1748453422| ~y$r_buff0_thd0~0_In-1748453422) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1748453422, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1748453422} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1748453422, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1748453422|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1748453422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:35:35,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L824-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1086010703 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1086010703 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1086010703 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1086010703 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out-1086010703|)) (and (= ~y$r_buff1_thd0~0_In-1086010703 |ULTIMATE.start_main_#t~ite40_Out-1086010703|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1086010703, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1086010703, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1086010703, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1086010703} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1086010703|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1086010703, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1086010703, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1086010703, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1086010703} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:35:35,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_136 |v_ULTIMATE.start_main_#t~ite40_46|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_43) (= v_~x~0_34 2) (= 0 v_~__unbuffered_p2_EAX~0_98))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256))) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:35:36,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:35:36 BasicIcfg [2019-12-07 11:35:36,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:35:36,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:35:36,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:35:36,013 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:35:36,014 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:35:23" (3/4) ... [2019-12-07 11:35:36,015 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:35:36,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$w_buff1_used~0_392 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1400~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1400~0.base_31|) |v_ULTIMATE.start_main_~#t1400~0.offset_23| 0)) |v_#memory_int_17|) (= v_~x~0_45 0) (= v_~y$mem_tmp~0_16 0) (= |v_ULTIMATE.start_main_~#t1400~0.offset_23| 0) (= 0 v_~y$r_buff1_thd1~0_88) (= v_~weak$$choice2~0_148 0) (= v_~y$r_buff0_thd1~0_34 0) (= v_~y$w_buff0_used~0_595 0) (= v_~y$r_buff1_thd0~0_147 0) (= 0 v_~y$flush_delayed~0_39) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$r_buff0_thd3~0_173) (= v_~y$r_buff0_thd0~0_94 0) (= 0 v_~__unbuffered_p2_EAX~0_109) (= 0 v_~y$r_buff0_thd2~0_289) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1400~0.base_31|)) (= v_~y$w_buff1~0_216 0) (= v_~z~0_45 0) (= 0 v_~y$w_buff0~0_304) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1400~0.base_31|) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= v_~y~0_127 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1400~0.base_31| 4)) (= v_~main$tmp_guard0~0_20 0) (= v_~y$read_delayed~0_5 0) (= v_~main$tmp_guard1~0_32 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1400~0.base_31| 1) |v_#valid_62|) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff1_thd2~0_268) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd3~0_150) (= 0 v_~__unbuffered_cnt~0_97) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t1400~0.base=|v_ULTIMATE.start_main_~#t1400~0.base_31|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_150, ULTIMATE.start_main_~#t1400~0.offset=|v_ULTIMATE.start_main_~#t1400~0.offset_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_34, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_~#t1402~0.base=|v_ULTIMATE.start_main_~#t1402~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_65|, ULTIMATE.start_main_~#t1401~0.base=|v_ULTIMATE.start_main_~#t1401~0.base_29|, ~y$w_buff1~0=v_~y$w_buff1~0_216, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_289, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~x~0=v_~x~0_45, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_595, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t1401~0.offset=|v_ULTIMATE.start_main_~#t1401~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ~y$w_buff0~0=v_~y$w_buff0~0_304, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~y~0=v_~y~0_127, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_268, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1402~0.offset=|v_ULTIMATE.start_main_~#t1402~0.offset_15|, ~z~0=v_~z~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1400~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1401~0.offset, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t1400~0.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1402~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1401~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ULTIMATE.start_main_~#t1402~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:35:36,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L810-1-->L812: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1401~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1401~0.base_9| 0)) (= 0 |v_ULTIMATE.start_main_~#t1401~0.offset_9|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1401~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1401~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1401~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1401~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1401~0.base_9|) |v_ULTIMATE.start_main_~#t1401~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1401~0.base=|v_ULTIMATE.start_main_~#t1401~0.base_9|, ULTIMATE.start_main_~#t1401~0.offset=|v_ULTIMATE.start_main_~#t1401~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1401~0.base, ULTIMATE.start_main_~#t1401~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 11:35:36,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L812-1-->L814: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1402~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t1402~0.base_10| 0)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1402~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1402~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1402~0.base_10|) |v_ULTIMATE.start_main_~#t1402~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1402~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1402~0.offset_9|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1402~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1402~0.offset=|v_ULTIMATE.start_main_~#t1402~0.offset_9|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1402~0.base=|v_ULTIMATE.start_main_~#t1402~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t1402~0.offset, #length, ULTIMATE.start_main_~#t1402~0.base] because there is no mapped edge [2019-12-07 11:35:36,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L4-->L787: Formula: (and (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_26) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_4) (= v_~y$r_buff0_thd3~0_25 1) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18)) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_26 v_~y$r_buff1_thd3~0_26)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~z~0=v_~z~0_4} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_4, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:35:36,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_32 1) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= v_~x~0_16 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z~0=v_~z~0_32, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_16, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 11:35:36,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L752-->L752-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-681835849 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite8_Out-681835849| |P1Thread1of1ForFork1_#t~ite9_Out-681835849|) (= ~y$w_buff0~0_In-681835849 |P1Thread1of1ForFork1_#t~ite8_Out-681835849|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-681835849 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-681835849 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-681835849 256))) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In-681835849 256) 0)))) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite8_In-681835849| |P1Thread1of1ForFork1_#t~ite8_Out-681835849|) (= ~y$w_buff0~0_In-681835849 |P1Thread1of1ForFork1_#t~ite9_Out-681835849|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-681835849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-681835849, ~y$w_buff0~0=~y$w_buff0~0_In-681835849, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-681835849, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-681835849|, ~weak$$choice2~0=~weak$$choice2~0_In-681835849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681835849} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-681835849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-681835849, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-681835849|, ~y$w_buff0~0=~y$w_buff0~0_In-681835849, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-681835849, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-681835849|, ~weak$$choice2~0=~weak$$choice2~0_In-681835849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-681835849} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 11:35:36,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L753-->L753-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1861724792 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite12_Out1861724792| ~y$w_buff1~0_In1861724792) (= |P1Thread1of1ForFork1_#t~ite11_In1861724792| |P1Thread1of1ForFork1_#t~ite11_Out1861724792|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite12_Out1861724792| |P1Thread1of1ForFork1_#t~ite11_Out1861724792|) (= ~y$w_buff1~0_In1861724792 |P1Thread1of1ForFork1_#t~ite11_Out1861724792|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1861724792 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1861724792 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1861724792 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1861724792 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1861724792, ~y$w_buff1~0=~y$w_buff1~0_In1861724792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1861724792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1861724792, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In1861724792|, ~weak$$choice2~0=~weak$$choice2~0_In1861724792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1861724792} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1861724792, ~y$w_buff1~0=~y$w_buff1~0_In1861724792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1861724792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1861724792, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1861724792|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1861724792|, ~weak$$choice2~0=~weak$$choice2~0_In1861724792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1861724792} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 11:35:36,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L756-->L757: Formula: (and (= v_~y$r_buff0_thd2~0_124 v_~y$r_buff0_thd2~0_123) (not (= (mod v_~weak$$choice2~0_36 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_36} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_123, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_36} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:35:36,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L759-->L767: Formula: (and (= v_~__unbuffered_cnt~0_24 (+ v_~__unbuffered_cnt~0_25 1)) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_33 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y~0=v_~y~0_33, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 11:35:36,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-165427219 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-165427219 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out-165427219| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out-165427219| ~y$w_buff0_used~0_In-165427219)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-165427219, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-165427219} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-165427219, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-165427219, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-165427219|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 11:35:36,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1756559810 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1756559810 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1756559810 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1756559810 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite29_Out1756559810| ~y$w_buff1_used~0_In1756559810)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1756559810|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1756559810, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1756559810, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1756559810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1756559810} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1756559810, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1756559810, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1756559810, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1756559810|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1756559810} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 11:35:36,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L790-->L791: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In1105449863 ~y$r_buff0_thd3~0_Out1105449863)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1105449863 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1105449863 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~y$r_buff0_thd3~0_Out1105449863) (not .cse1) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1105449863, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1105449863} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1105449863, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1105449863|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1105449863} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:35:36,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1447049678 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1447049678 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1447049678 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1447049678 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1447049678 |P2Thread1of1ForFork2_#t~ite31_Out1447049678|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out1447049678|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1447049678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1447049678, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447049678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1447049678} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1447049678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1447049678, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1447049678|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447049678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1447049678} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 11:35:36,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_57) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 11:35:36,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L814-1-->L820: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_23) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:35:36,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L820-2-->L820-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In831808684 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In831808684 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out831808684| ~y$w_buff1~0_In831808684)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out831808684| ~y~0_In831808684)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In831808684, ~y~0=~y~0_In831808684, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In831808684, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831808684} OutVars{~y$w_buff1~0=~y$w_buff1~0_In831808684, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out831808684|, ~y~0=~y~0_In831808684, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In831808684, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831808684} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 11:35:36,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L820-4-->L821: Formula: (= v_~y~0_26 |v_ULTIMATE.start_main_#t~ite35_14|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 11:35:36,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1778593280 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1778593280 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1778593280 |ULTIMATE.start_main_#t~ite37_Out1778593280|)) (and (= |ULTIMATE.start_main_#t~ite37_Out1778593280| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1778593280, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1778593280} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1778593280, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1778593280, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1778593280|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:35:36,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2128283667 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2128283667 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2128283667 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In2128283667 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out2128283667| ~y$w_buff1_used~0_In2128283667)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out2128283667| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2128283667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2128283667, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2128283667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2128283667} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2128283667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2128283667, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out2128283667|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2128283667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2128283667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 11:35:36,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1748453422 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1748453422 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-1748453422| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1748453422| ~y$r_buff0_thd0~0_In-1748453422) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1748453422, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1748453422} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1748453422, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1748453422|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1748453422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:35:36,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L824-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1086010703 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1086010703 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1086010703 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1086010703 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out-1086010703|)) (and (= ~y$r_buff1_thd0~0_In-1086010703 |ULTIMATE.start_main_#t~ite40_Out-1086010703|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1086010703, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1086010703, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1086010703, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1086010703} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1086010703|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1086010703, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1086010703, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1086010703, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1086010703} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:35:36,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_136 |v_ULTIMATE.start_main_#t~ite40_46|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_43) (= v_~x~0_34 2) (= 0 v_~__unbuffered_p2_EAX~0_98))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256))) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:35:36,072 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7e913939-31ea-4951-96f7-9e9720839e7a/bin/uautomizer/witness.graphml [2019-12-07 11:35:36,072 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:35:36,073 INFO L168 Benchmark]: Toolchain (without parser) took 13534.80 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 764.9 MB). Free memory was 934.0 MB in the beginning and 1.2 GB in the end (delta: -271.5 MB). Peak memory consumption was 493.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:35:36,073 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:35:36,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -129.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:35:36,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.35 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 11:35:36,074 INFO L168 Benchmark]: Boogie Preprocessor took 24.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:35:36,074 INFO L168 Benchmark]: RCFGBuilder took 363.00 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: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:35:36,075 INFO L168 Benchmark]: TraceAbstraction took 12653.12 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 669.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -219.0 MB). Peak memory consumption was 450.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:35:36,075 INFO L168 Benchmark]: Witness Printer took 58.91 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:35:36,077 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 394.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -129.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.35 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. * Boogie Preprocessor took 24.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 363.00 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: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12653.12 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 669.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -219.0 MB). Peak memory consumption was 450.5 MB. Max. memory is 11.5 GB. * Witness Printer took 58.91 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 151 ProgramPointsBefore, 72 ProgramPointsAfterwards, 176 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 21 ChoiceCompositions, 5098 VarBasedMoverChecksPositive, 188 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 154 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 0 MoverChecksTotal, 39870 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1400, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1401, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1402, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 1 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 2 x = 2 [L747] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 2 y$flush_delayed = weak$$choice2 [L750] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L752] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L753] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L754] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L755] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.5s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2758 SDtfs, 2664 SDslu, 6964 SDs, 0 SdLazy, 5512 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 28 SyntacticMatches, 15 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18074occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 14409 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 563 ConstructedInterpolants, 0 QuantifiedInterpolants, 82231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...