./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_pso.oepc.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_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/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 61950e5134783ff41854193442a0b82c08021557 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 18:25:57,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:25:57,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:25:57,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:25:57,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:25:57,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:25:57,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:25:57,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:25:57,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:25:57,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:25:57,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:25:57,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:25:57,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:25:57,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:25:57,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:25:57,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:25:57,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:25:57,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:25:57,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:25:57,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:25:57,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:25:57,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:25:57,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:25:57,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:25:57,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:25:57,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:25:57,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:25:57,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:25:57,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:25:57,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:25:57,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:25:57,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:25:57,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:25:57,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:25:57,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:25:57,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:25:57,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:25:57,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:25:57,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:25:57,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:25:57,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:25:57,259 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:25:57,268 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:25:57,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:25:57,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:25:57,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:25:57,269 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:25:57,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:25:57,270 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:25:57,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:25:57,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:25:57,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:25:57,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:25:57,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:25:57,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:25:57,270 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:25:57,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:25:57,271 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:25:57,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:25:57,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:25:57,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:25:57,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:25:57,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:25:57,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:25:57,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:25:57,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:25:57,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:25:57,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:25:57,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:25:57,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:25:57,272 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:25:57,272 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_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/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 -> 61950e5134783ff41854193442a0b82c08021557 [2019-12-07 18:25:57,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:25:57,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:25:57,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:25:57,387 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:25:57,387 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:25:57,387 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix022_pso.oepc.i [2019-12-07 18:25:57,427 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/bin/uautomizer/data/d371a6402/4adb52c4e87e4961a6834741d3608921/FLAGa385f24d6 [2019-12-07 18:25:57,873 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:25:57,873 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/sv-benchmarks/c/pthread-wmm/mix022_pso.oepc.i [2019-12-07 18:25:57,883 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/bin/uautomizer/data/d371a6402/4adb52c4e87e4961a6834741d3608921/FLAGa385f24d6 [2019-12-07 18:25:57,891 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/bin/uautomizer/data/d371a6402/4adb52c4e87e4961a6834741d3608921 [2019-12-07 18:25:57,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:25:57,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:25:57,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:25:57,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:25:57,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:25:57,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:25:57" (1/1) ... [2019-12-07 18:25:57,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1693e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:57, skipping insertion in model container [2019-12-07 18:25:57,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:25:57" (1/1) ... [2019-12-07 18:25:57,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:25:57,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:25:58,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:25:58,177 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:25:58,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:25:58,281 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:25:58,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58 WrapperNode [2019-12-07 18:25:58,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:25:58,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:25:58,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:25:58,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:25:58,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:25:58,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:25:58,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:25:58,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:25:58,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:25:58,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:25:58,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:25:58,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:25:58,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/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 18:25:58,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:25:58,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:25:58,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:25:58,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:25:58,401 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:25:58,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:25:58,402 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:25:58,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:25:58,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:25:58,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:25:58,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:25:58,403 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 18:25:58,755 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:25:58,755 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:25:58,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:25:58 BoogieIcfgContainer [2019-12-07 18:25:58,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:25:58,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:25:58,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:25:58,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:25:58,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:25:57" (1/3) ... [2019-12-07 18:25:58,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15566339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:25:58, skipping insertion in model container [2019-12-07 18:25:58,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (2/3) ... [2019-12-07 18:25:58,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15566339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:25:58, skipping insertion in model container [2019-12-07 18:25:58,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:25:58" (3/3) ... [2019-12-07 18:25:58,761 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_pso.oepc.i [2019-12-07 18:25:58,767 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:25:58,767 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:25:58,773 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:25:58,773 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:25:58,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,799 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,799 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,799 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,799 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,799 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,805 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,805 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:25:58,828 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 18:25:58,840 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:25:58,841 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:25:58,841 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:25:58,841 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:25:58,841 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:25:58,841 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:25:58,841 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:25:58,841 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:25:58,851 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 18:25:58,852 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 18:25:58,899 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 18:25:58,899 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:25:58,907 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 18:25:58,918 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 18:25:58,941 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 18:25:58,941 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:25:58,945 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 18:25:58,955 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 18:25:58,956 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:26:01,721 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 18:26:01,808 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-07 18:26:01,808 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-07 18:26:01,810 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-07 18:26:02,189 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 18:26:02,190 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 18:26:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 18:26:02,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:02,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 18:26:02,195 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:02,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:02,199 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-07 18:26:02,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:02,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817792397] [2019-12-07 18:26:02,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:02,333 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 18:26:02,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817792397] [2019-12-07 18:26:02,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:02,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:26:02,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652648547] [2019-12-07 18:26:02,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:02,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:02,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:02,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:02,349 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 18:26:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:02,511 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-07 18:26:02,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:02,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 18:26:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:02,569 INFO L225 Difference]: With dead ends: 8468 [2019-12-07 18:26:02,569 INFO L226 Difference]: Without dead ends: 7976 [2019-12-07 18:26:02,570 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 18:26:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-07 18:26:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-07 18:26:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-07 18:26:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-07 18:26:02,836 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-07 18:26:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:02,836 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-07 18:26:02,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:02,837 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-07 18:26:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:26:02,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:02,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:02,839 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:02,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:02,839 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-07 18:26:02,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:02,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218655300] [2019-12-07 18:26:02,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:02,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 18:26:02,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218655300] [2019-12-07 18:26:02,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:02,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:02,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713717004] [2019-12-07 18:26:02,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:26:02,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:02,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:26:02,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:26:02,907 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-07 18:26:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:02,951 INFO L93 Difference]: Finished difference Result 1834 states and 4623 transitions. [2019-12-07 18:26:02,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:26:02,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:26:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:02,958 INFO L225 Difference]: With dead ends: 1834 [2019-12-07 18:26:02,958 INFO L226 Difference]: Without dead ends: 1342 [2019-12-07 18:26:02,958 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 18:26:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-12-07 18:26:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2019-12-07 18:26:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-12-07 18:26:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 3045 transitions. [2019-12-07 18:26:02,982 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 3045 transitions. Word has length 11 [2019-12-07 18:26:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:02,982 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 3045 transitions. [2019-12-07 18:26:02,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:26:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 3045 transitions. [2019-12-07 18:26:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:26:02,983 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:02,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:02,984 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:02,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:02,984 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-07 18:26:02,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:02,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357467899] [2019-12-07 18:26:02,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:03,036 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 18:26:03,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357467899] [2019-12-07 18:26:03,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:03,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:26:03,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934096603] [2019-12-07 18:26:03,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:26:03,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:03,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:26:03,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:26:03,038 INFO L87 Difference]: Start difference. First operand 1342 states and 3045 transitions. Second operand 4 states. [2019-12-07 18:26:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:03,165 INFO L93 Difference]: Finished difference Result 1673 states and 3729 transitions. [2019-12-07 18:26:03,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:26:03,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:26:03,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:03,176 INFO L225 Difference]: With dead ends: 1673 [2019-12-07 18:26:03,176 INFO L226 Difference]: Without dead ends: 1673 [2019-12-07 18:26:03,176 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 18:26:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-12-07 18:26:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1609. [2019-12-07 18:26:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-12-07 18:26:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3605 transitions. [2019-12-07 18:26:03,213 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3605 transitions. Word has length 14 [2019-12-07 18:26:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:03,214 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3605 transitions. [2019-12-07 18:26:03,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:26:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3605 transitions. [2019-12-07 18:26:03,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:26:03,216 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:03,217 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:03,217 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:03,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:03,217 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-07 18:26:03,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:03,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618482959] [2019-12-07 18:26:03,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:03,327 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 18:26:03,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618482959] [2019-12-07 18:26:03,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:03,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:26:03,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73065260] [2019-12-07 18:26:03,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:26:03,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:03,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:26:03,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:26:03,328 INFO L87 Difference]: Start difference. First operand 1609 states and 3605 transitions. Second operand 6 states. [2019-12-07 18:26:03,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:03,674 INFO L93 Difference]: Finished difference Result 4481 states and 9905 transitions. [2019-12-07 18:26:03,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:26:03,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 18:26:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:03,693 INFO L225 Difference]: With dead ends: 4481 [2019-12-07 18:26:03,693 INFO L226 Difference]: Without dead ends: 4446 [2019-12-07 18:26:03,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:26:03,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-12-07 18:26:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 2169. [2019-12-07 18:26:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-12-07 18:26:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 4909 transitions. [2019-12-07 18:26:03,737 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 4909 transitions. Word has length 25 [2019-12-07 18:26:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:03,737 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 4909 transitions. [2019-12-07 18:26:03,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:26:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 4909 transitions. [2019-12-07 18:26:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:26:03,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:03,739 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] [2019-12-07 18:26:03,739 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:03,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:03,740 INFO L82 PathProgramCache]: Analyzing trace with hash -662536504, now seen corresponding path program 1 times [2019-12-07 18:26:03,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:03,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220134715] [2019-12-07 18:26:03,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:03,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220134715] [2019-12-07 18:26:03,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:03,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:26:03,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156456217] [2019-12-07 18:26:03,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:26:03,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:03,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:26:03,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:26:03,795 INFO L87 Difference]: Start difference. First operand 2169 states and 4909 transitions. Second operand 5 states. [2019-12-07 18:26:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:04,061 INFO L93 Difference]: Finished difference Result 3139 states and 6955 transitions. [2019-12-07 18:26:04,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:26:04,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 18:26:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:04,076 INFO L225 Difference]: With dead ends: 3139 [2019-12-07 18:26:04,076 INFO L226 Difference]: Without dead ends: 3139 [2019-12-07 18:26:04,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 18:26:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-12-07 18:26:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2639. [2019-12-07 18:26:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-12-07 18:26:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 5924 transitions. [2019-12-07 18:26:04,123 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 5924 transitions. Word has length 26 [2019-12-07 18:26:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:04,123 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 5924 transitions. [2019-12-07 18:26:04,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:26:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 5924 transitions. [2019-12-07 18:26:04,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:26:04,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:04,125 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] [2019-12-07 18:26:04,126 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:04,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-07 18:26:04,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:04,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254025] [2019-12-07 18:26:04,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:04,183 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 18:26:04,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254025] [2019-12-07 18:26:04,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:04,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:26:04,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81539580] [2019-12-07 18:26:04,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:26:04,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:26:04,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:26:04,185 INFO L87 Difference]: Start difference. First operand 2639 states and 5924 transitions. Second operand 6 states. [2019-12-07 18:26:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:04,534 INFO L93 Difference]: Finished difference Result 5512 states and 12000 transitions. [2019-12-07 18:26:04,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:26:04,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 18:26:04,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:04,544 INFO L225 Difference]: With dead ends: 5512 [2019-12-07 18:26:04,544 INFO L226 Difference]: Without dead ends: 5483 [2019-12-07 18:26:04,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:26:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2019-12-07 18:26:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 2614. [2019-12-07 18:26:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2019-12-07 18:26:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 5890 transitions. [2019-12-07 18:26:04,598 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 5890 transitions. Word has length 26 [2019-12-07 18:26:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:04,598 INFO L462 AbstractCegarLoop]: Abstraction has 2614 states and 5890 transitions. [2019-12-07 18:26:04,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:26:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 5890 transitions. [2019-12-07 18:26:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:26:04,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:04,601 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] [2019-12-07 18:26:04,602 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:04,602 INFO L82 PathProgramCache]: Analyzing trace with hash -312964189, now seen corresponding path program 1 times [2019-12-07 18:26:04,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:04,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019501040] [2019-12-07 18:26:04,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:04,660 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 18:26:04,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019501040] [2019-12-07 18:26:04,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:04,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:26:04,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929226207] [2019-12-07 18:26:04,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:26:04,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:04,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:26:04,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:26:04,662 INFO L87 Difference]: Start difference. First operand 2614 states and 5890 transitions. Second operand 5 states. [2019-12-07 18:26:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:04,692 INFO L93 Difference]: Finished difference Result 1600 states and 3459 transitions. [2019-12-07 18:26:04,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:26:04,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 18:26:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:04,695 INFO L225 Difference]: With dead ends: 1600 [2019-12-07 18:26:04,695 INFO L226 Difference]: Without dead ends: 1454 [2019-12-07 18:26:04,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:26:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2019-12-07 18:26:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1353. [2019-12-07 18:26:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2019-12-07 18:26:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2958 transitions. [2019-12-07 18:26:04,714 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2958 transitions. Word has length 27 [2019-12-07 18:26:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:04,714 INFO L462 AbstractCegarLoop]: Abstraction has 1353 states and 2958 transitions. [2019-12-07 18:26:04,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:26:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2958 transitions. [2019-12-07 18:26:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:26:04,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:04,717 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:04,718 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:04,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:04,718 INFO L82 PathProgramCache]: Analyzing trace with hash 62245946, now seen corresponding path program 1 times [2019-12-07 18:26:04,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:04,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122742407] [2019-12-07 18:26:04,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:04,829 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 18:26:04,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122742407] [2019-12-07 18:26:04,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:04,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:26:04,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277063341] [2019-12-07 18:26:04,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:26:04,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:04,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:26:04,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:26:04,830 INFO L87 Difference]: Start difference. First operand 1353 states and 2958 transitions. Second operand 7 states. [2019-12-07 18:26:05,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:05,580 INFO L93 Difference]: Finished difference Result 2931 states and 6214 transitions. [2019-12-07 18:26:05,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 18:26:05,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-07 18:26:05,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:05,586 INFO L225 Difference]: With dead ends: 2931 [2019-12-07 18:26:05,586 INFO L226 Difference]: Without dead ends: 2931 [2019-12-07 18:26:05,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:26:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2019-12-07 18:26:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1433. [2019-12-07 18:26:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-12-07 18:26:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 3150 transitions. [2019-12-07 18:26:05,611 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 3150 transitions. Word has length 51 [2019-12-07 18:26:05,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:05,612 INFO L462 AbstractCegarLoop]: Abstraction has 1433 states and 3150 transitions. [2019-12-07 18:26:05,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:26:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 3150 transitions. [2019-12-07 18:26:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:26:05,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:05,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:05,615 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:05,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:05,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1305614862, now seen corresponding path program 2 times [2019-12-07 18:26:05,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:05,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587196397] [2019-12-07 18:26:05,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:05,675 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 18:26:05,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587196397] [2019-12-07 18:26:05,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:05,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:26:05,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527259974] [2019-12-07 18:26:05,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:05,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:05,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:05,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:05,677 INFO L87 Difference]: Start difference. First operand 1433 states and 3150 transitions. Second operand 3 states. [2019-12-07 18:26:05,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:05,718 INFO L93 Difference]: Finished difference Result 1846 states and 4008 transitions. [2019-12-07 18:26:05,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:05,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 18:26:05,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:05,722 INFO L225 Difference]: With dead ends: 1846 [2019-12-07 18:26:05,723 INFO L226 Difference]: Without dead ends: 1846 [2019-12-07 18:26:05,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 18:26:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2019-12-07 18:26:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1443. [2019-12-07 18:26:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-12-07 18:26:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 3176 transitions. [2019-12-07 18:26:05,742 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 3176 transitions. Word has length 51 [2019-12-07 18:26:05,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:05,742 INFO L462 AbstractCegarLoop]: Abstraction has 1443 states and 3176 transitions. [2019-12-07 18:26:05,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 3176 transitions. [2019-12-07 18:26:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:26:05,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:05,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:05,745 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:05,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:05,745 INFO L82 PathProgramCache]: Analyzing trace with hash -972871791, now seen corresponding path program 1 times [2019-12-07 18:26:05,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:05,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52062586] [2019-12-07 18:26:05,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:05,833 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 18:26:05,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52062586] [2019-12-07 18:26:05,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:05,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:26:05,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371525463] [2019-12-07 18:26:05,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:26:05,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:05,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:26:05,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:26:05,834 INFO L87 Difference]: Start difference. First operand 1443 states and 3176 transitions. Second operand 8 states. [2019-12-07 18:26:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:06,767 INFO L93 Difference]: Finished difference Result 2999 states and 6360 transitions. [2019-12-07 18:26:06,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 18:26:06,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-07 18:26:06,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:06,770 INFO L225 Difference]: With dead ends: 2999 [2019-12-07 18:26:06,771 INFO L226 Difference]: Without dead ends: 2999 [2019-12-07 18:26:06,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:26:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-12-07 18:26:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1468. [2019-12-07 18:26:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2019-12-07 18:26:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 3211 transitions. [2019-12-07 18:26:06,807 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 3211 transitions. Word has length 52 [2019-12-07 18:26:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:06,808 INFO L462 AbstractCegarLoop]: Abstraction has 1468 states and 3211 transitions. [2019-12-07 18:26:06,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:26:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 3211 transitions. [2019-12-07 18:26:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:26:06,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:06,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:06,811 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:06,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:06,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1641556840, now seen corresponding path program 1 times [2019-12-07 18:26:06,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:06,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295039988] [2019-12-07 18:26:06,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:06,896 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 18:26:06,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295039988] [2019-12-07 18:26:06,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:06,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:26:06,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945312075] [2019-12-07 18:26:06,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:26:06,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:06,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:26:06,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:26:06,898 INFO L87 Difference]: Start difference. First operand 1468 states and 3211 transitions. Second operand 7 states. [2019-12-07 18:26:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:07,512 INFO L93 Difference]: Finished difference Result 2900 states and 6077 transitions. [2019-12-07 18:26:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 18:26:07,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 18:26:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:07,514 INFO L225 Difference]: With dead ends: 2900 [2019-12-07 18:26:07,514 INFO L226 Difference]: Without dead ends: 2900 [2019-12-07 18:26:07,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:26:07,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2019-12-07 18:26:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1506. [2019-12-07 18:26:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1506 states. [2019-12-07 18:26:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 3296 transitions. [2019-12-07 18:26:07,534 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 3296 transitions. Word has length 52 [2019-12-07 18:26:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:07,534 INFO L462 AbstractCegarLoop]: Abstraction has 1506 states and 3296 transitions. [2019-12-07 18:26:07,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:26:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 3296 transitions. [2019-12-07 18:26:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:26:07,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:07,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:07,536 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:07,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:07,536 INFO L82 PathProgramCache]: Analyzing trace with hash 843046701, now seen corresponding path program 2 times [2019-12-07 18:26:07,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:07,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447682072] [2019-12-07 18:26:07,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:07,616 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 18:26:07,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447682072] [2019-12-07 18:26:07,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:07,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:07,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021906364] [2019-12-07 18:26:07,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:26:07,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:07,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:26:07,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:26:07,617 INFO L87 Difference]: Start difference. First operand 1506 states and 3296 transitions. Second operand 4 states. [2019-12-07 18:26:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:07,634 INFO L93 Difference]: Finished difference Result 2707 states and 5915 transitions. [2019-12-07 18:26:07,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:26:07,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 18:26:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:07,635 INFO L225 Difference]: With dead ends: 2707 [2019-12-07 18:26:07,635 INFO L226 Difference]: Without dead ends: 1270 [2019-12-07 18:26:07,636 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 18:26:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-12-07 18:26:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1270. [2019-12-07 18:26:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2019-12-07 18:26:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 2749 transitions. [2019-12-07 18:26:07,653 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 2749 transitions. Word has length 52 [2019-12-07 18:26:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:07,653 INFO L462 AbstractCegarLoop]: Abstraction has 1270 states and 2749 transitions. [2019-12-07 18:26:07,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:26:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 2749 transitions. [2019-12-07 18:26:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:26:07,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:07,655 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:07,655 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:07,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:07,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1250007013, now seen corresponding path program 3 times [2019-12-07 18:26:07,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:07,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692512716] [2019-12-07 18:26:07,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:07,710 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 18:26:07,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692512716] [2019-12-07 18:26:07,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:07,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:26:07,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201710643] [2019-12-07 18:26:07,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:07,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:07,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:07,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:07,712 INFO L87 Difference]: Start difference. First operand 1270 states and 2749 transitions. Second operand 3 states. [2019-12-07 18:26:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:07,722 INFO L93 Difference]: Finished difference Result 1269 states and 2747 transitions. [2019-12-07 18:26:07,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:07,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 18:26:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:07,724 INFO L225 Difference]: With dead ends: 1269 [2019-12-07 18:26:07,724 INFO L226 Difference]: Without dead ends: 1269 [2019-12-07 18:26:07,724 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 18:26:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-12-07 18:26:07,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 881. [2019-12-07 18:26:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-12-07 18:26:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1935 transitions. [2019-12-07 18:26:07,734 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1935 transitions. Word has length 52 [2019-12-07 18:26:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:07,735 INFO L462 AbstractCegarLoop]: Abstraction has 881 states and 1935 transitions. [2019-12-07 18:26:07,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1935 transitions. [2019-12-07 18:26:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:26:07,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:07,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:07,736 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:07,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:07,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1803579188, now seen corresponding path program 1 times [2019-12-07 18:26:07,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:07,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383937037] [2019-12-07 18:26:07,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:07,946 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 18:26:07,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383937037] [2019-12-07 18:26:07,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:07,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:26:07,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655212005] [2019-12-07 18:26:07,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:26:07,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:07,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:26:07,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:26:07,947 INFO L87 Difference]: Start difference. First operand 881 states and 1935 transitions. Second operand 12 states. [2019-12-07 18:26:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:09,026 INFO L93 Difference]: Finished difference Result 1410 states and 3044 transitions. [2019-12-07 18:26:09,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 18:26:09,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-07 18:26:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:09,028 INFO L225 Difference]: With dead ends: 1410 [2019-12-07 18:26:09,028 INFO L226 Difference]: Without dead ends: 900 [2019-12-07 18:26:09,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:26:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-12-07 18:26:09,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 894. [2019-12-07 18:26:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-12-07 18:26:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1948 transitions. [2019-12-07 18:26:09,042 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1948 transitions. Word has length 53 [2019-12-07 18:26:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:09,042 INFO L462 AbstractCegarLoop]: Abstraction has 894 states and 1948 transitions. [2019-12-07 18:26:09,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:26:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1948 transitions. [2019-12-07 18:26:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:26:09,043 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:09,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:09,044 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:09,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:09,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1101315546, now seen corresponding path program 2 times [2019-12-07 18:26:09,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:09,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607209378] [2019-12-07 18:26:09,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:09,265 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 18:26:09,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607209378] [2019-12-07 18:26:09,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:09,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 18:26:09,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17813067] [2019-12-07 18:26:09,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:26:09,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:09,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:26:09,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:26:09,266 INFO L87 Difference]: Start difference. First operand 894 states and 1948 transitions. Second operand 13 states. [2019-12-07 18:26:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:09,899 INFO L93 Difference]: Finished difference Result 1085 states and 2300 transitions. [2019-12-07 18:26:09,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:26:09,899 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-12-07 18:26:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:09,900 INFO L225 Difference]: With dead ends: 1085 [2019-12-07 18:26:09,900 INFO L226 Difference]: Without dead ends: 875 [2019-12-07 18:26:09,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:26:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-07 18:26:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 869. [2019-12-07 18:26:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-12-07 18:26:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1898 transitions. [2019-12-07 18:26:09,909 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1898 transitions. Word has length 53 [2019-12-07 18:26:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:09,909 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1898 transitions. [2019-12-07 18:26:09,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:26:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1898 transitions. [2019-12-07 18:26:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:26:09,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:09,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:09,910 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:09,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1821077354, now seen corresponding path program 3 times [2019-12-07 18:26:09,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:09,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367647243] [2019-12-07 18:26:09,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:10,117 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 18:26:10,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367647243] [2019-12-07 18:26:10,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:10,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 18:26:10,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533465918] [2019-12-07 18:26:10,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:26:10,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:10,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:26:10,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:26:10,118 INFO L87 Difference]: Start difference. First operand 869 states and 1898 transitions. Second operand 13 states. [2019-12-07 18:26:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:12,090 INFO L93 Difference]: Finished difference Result 1387 states and 2981 transitions. [2019-12-07 18:26:12,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 18:26:12,091 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-12-07 18:26:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:12,092 INFO L225 Difference]: With dead ends: 1387 [2019-12-07 18:26:12,093 INFO L226 Difference]: Without dead ends: 877 [2019-12-07 18:26:12,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:26:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-12-07 18:26:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 871. [2019-12-07 18:26:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-12-07 18:26:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1900 transitions. [2019-12-07 18:26:12,113 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1900 transitions. Word has length 53 [2019-12-07 18:26:12,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:12,113 INFO L462 AbstractCegarLoop]: Abstraction has 871 states and 1900 transitions. [2019-12-07 18:26:12,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:26:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1900 transitions. [2019-12-07 18:26:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:26:12,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:12,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:12,116 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1771626300, now seen corresponding path program 4 times [2019-12-07 18:26:12,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:12,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409743536] [2019-12-07 18:26:12,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:12,201 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 18:26:12,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409743536] [2019-12-07 18:26:12,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:12,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:26:12,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973857874] [2019-12-07 18:26:12,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:26:12,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:12,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:26:12,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:26:12,203 INFO L87 Difference]: Start difference. First operand 871 states and 1900 transitions. Second operand 7 states. [2019-12-07 18:26:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:12,353 INFO L93 Difference]: Finished difference Result 1406 states and 3003 transitions. [2019-12-07 18:26:12,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:26:12,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 18:26:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:12,354 INFO L225 Difference]: With dead ends: 1406 [2019-12-07 18:26:12,354 INFO L226 Difference]: Without dead ends: 1052 [2019-12-07 18:26:12,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:26:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-12-07 18:26:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 878. [2019-12-07 18:26:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-07 18:26:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1910 transitions. [2019-12-07 18:26:12,363 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1910 transitions. Word has length 53 [2019-12-07 18:26:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:12,364 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1910 transitions. [2019-12-07 18:26:12,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:26:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1910 transitions. [2019-12-07 18:26:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:26:12,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:12,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:26:12,365 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:12,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:12,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 5 times [2019-12-07 18:26:12,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:12,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28639517] [2019-12-07 18:26:12,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:26:12,450 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:26:12,450 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:26:12,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= (select .cse0 |v_ULTIMATE.start_main_~#t589~0.base_29|) 0) (= v_~y$mem_tmp~0_26 0) (= |v_ULTIMATE.start_main_~#t589~0.offset_20| 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t589~0.base_29| 4)) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t589~0.base_29| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t589~0.base_29|) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t589~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t589~0.base_29|) |v_ULTIMATE.start_main_~#t589~0.offset_20| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, ULTIMATE.start_main_~#t590~0.base=|v_ULTIMATE.start_main_~#t590~0.base_17|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ULTIMATE.start_main_~#t590~0.offset=|v_ULTIMATE.start_main_~#t590~0.offset_14|, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t589~0.base=|v_ULTIMATE.start_main_~#t589~0.base_29|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t589~0.offset=|v_ULTIMATE.start_main_~#t589~0.offset_20|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t590~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t590~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t589~0.base, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t589~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:26:12,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t590~0.base_12|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t590~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t590~0.base_12|) |v_ULTIMATE.start_main_~#t590~0.offset_10| 1)) |v_#memory_int_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t590~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t590~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t590~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t590~0.base_12| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t590~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t590~0.offset=|v_ULTIMATE.start_main_~#t590~0.offset_10|, ULTIMATE.start_main_~#t590~0.base=|v_ULTIMATE.start_main_~#t590~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t590~0.offset, ULTIMATE.start_main_~#t590~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 18:26:12,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:26:12,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2120440141 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-2120440141 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2120440141|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-2120440141 |P0Thread1of1ForFork0_#t~ite5_Out-2120440141|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120440141, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2120440141} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2120440141|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120440141, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2120440141} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:26:12,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In183422257 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out183422257| ~y$w_buff0~0_In183422257) (= |P1Thread1of1ForFork1_#t~ite14_In183422257| |P1Thread1of1ForFork1_#t~ite14_Out183422257|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out183422257| |P1Thread1of1ForFork1_#t~ite14_Out183422257|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In183422257 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In183422257 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In183422257 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In183422257 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite14_Out183422257| ~y$w_buff0~0_In183422257)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In183422257, ~y$w_buff0_used~0=~y$w_buff0_used~0_In183422257, ~y$w_buff0~0=~y$w_buff0~0_In183422257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In183422257, ~weak$$choice2~0=~weak$$choice2~0_In183422257, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In183422257|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In183422257} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In183422257, ~y$w_buff0_used~0=~y$w_buff0_used~0_In183422257, ~y$w_buff0~0=~y$w_buff0~0_In183422257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In183422257, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out183422257|, ~weak$$choice2~0=~weak$$choice2~0_In183422257, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out183422257|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In183422257} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 18:26:12,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-168825926 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-168825926| |P1Thread1of1ForFork1_#t~ite17_Out-168825926|) (not .cse0) (= ~y$w_buff1~0_In-168825926 |P1Thread1of1ForFork1_#t~ite18_Out-168825926|)) (and (= ~y$w_buff1~0_In-168825926 |P1Thread1of1ForFork1_#t~ite17_Out-168825926|) (= |P1Thread1of1ForFork1_#t~ite17_Out-168825926| |P1Thread1of1ForFork1_#t~ite18_Out-168825926|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-168825926 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-168825926 256))) (= (mod ~y$w_buff0_used~0_In-168825926 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-168825926 256))))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-168825926, ~y$w_buff1~0=~y$w_buff1~0_In-168825926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-168825926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-168825926, ~weak$$choice2~0=~weak$$choice2~0_In-168825926, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-168825926|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-168825926} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-168825926, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-168825926|, ~y$w_buff1~0=~y$w_buff1~0_In-168825926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-168825926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-168825926, ~weak$$choice2~0=~weak$$choice2~0_In-168825926, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-168825926|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-168825926} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 18:26:12,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-597797756 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-597797756 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-597797756 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-597797756 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-597797756| ~y$w_buff1_used~0_In-597797756) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out-597797756| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-597797756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-597797756, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-597797756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-597797756} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-597797756|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-597797756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-597797756, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-597797756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-597797756} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:26:12,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In391657435 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In391657435 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out391657435 ~y$r_buff0_thd1~0_In391657435))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out391657435)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In391657435, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In391657435} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In391657435, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out391657435|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out391657435} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:26:12,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1976058199 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1976058199 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1976058199 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1976058199 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1976058199|)) (and (= ~y$r_buff1_thd1~0_In1976058199 |P0Thread1of1ForFork0_#t~ite8_Out1976058199|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1976058199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1976058199, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1976058199, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1976058199} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1976058199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1976058199, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1976058199|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1976058199, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1976058199} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:26:12,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1092865336 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1092865336 256)))) (or (= (mod ~y$w_buff0_used~0_In-1092865336 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1092865336 256)) .cse0) (and .cse0 (= (mod ~y$w_buff1_used~0_In-1092865336 256) 0)))) .cse1 (= ~y$w_buff0_used~0_In-1092865336 |P1Thread1of1ForFork1_#t~ite20_Out-1092865336|) (= |P1Thread1of1ForFork1_#t~ite21_Out-1092865336| |P1Thread1of1ForFork1_#t~ite20_Out-1092865336|)) (and (= ~y$w_buff0_used~0_In-1092865336 |P1Thread1of1ForFork1_#t~ite21_Out-1092865336|) (= |P1Thread1of1ForFork1_#t~ite20_In-1092865336| |P1Thread1of1ForFork1_#t~ite20_Out-1092865336|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1092865336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092865336, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1092865336|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1092865336, ~weak$$choice2~0=~weak$$choice2~0_In-1092865336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092865336} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1092865336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092865336, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1092865336|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1092865336, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1092865336|, ~weak$$choice2~0=~weak$$choice2~0_In-1092865336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092865336} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 18:26:12,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:26:12,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1186283447 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1186283447 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1186283447 256)) (and (= (mod ~y$r_buff1_thd2~0_In1186283447 256) 0) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In1186283447 256)) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out1186283447| ~y$r_buff1_thd2~0_In1186283447) (= |P1Thread1of1ForFork1_#t~ite30_Out1186283447| |P1Thread1of1ForFork1_#t~ite29_Out1186283447|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In1186283447| |P1Thread1of1ForFork1_#t~ite29_Out1186283447|) (= |P1Thread1of1ForFork1_#t~ite30_Out1186283447| ~y$r_buff1_thd2~0_In1186283447)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1186283447, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1186283447|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1186283447, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1186283447, ~weak$$choice2~0=~weak$$choice2~0_In1186283447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1186283447} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1186283447, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1186283447|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1186283447|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1186283447, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1186283447, ~weak$$choice2~0=~weak$$choice2~0_In1186283447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1186283447} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:26:12,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:26:12,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 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_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 18:26:12,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In343263277 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In343263277 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out343263277| ~y~0_In343263277) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out343263277| ~y$w_buff1~0_In343263277) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In343263277, ~y$w_buff1~0=~y$w_buff1~0_In343263277, ~y~0=~y~0_In343263277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In343263277} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In343263277, ~y$w_buff1~0=~y$w_buff1~0_In343263277, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out343263277|, ~y~0=~y~0_In343263277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In343263277} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 18:26:12,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 18:26:12,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In891475039 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In891475039 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out891475039| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out891475039| ~y$w_buff0_used~0_In891475039) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In891475039, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In891475039} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In891475039, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In891475039, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out891475039|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:26:12,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In631549317 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In631549317 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In631549317 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In631549317 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out631549317|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In631549317 |P1Thread1of1ForFork1_#t~ite35_Out631549317|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In631549317, ~y$w_buff0_used~0=~y$w_buff0_used~0_In631549317, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In631549317, ~y$w_buff1_used~0=~y$w_buff1_used~0_In631549317} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In631549317, ~y$w_buff0_used~0=~y$w_buff0_used~0_In631549317, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In631549317, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out631549317|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In631549317} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:26:12,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In641181355 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In641181355 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out641181355| ~y$r_buff0_thd2~0_In641181355) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out641181355| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In641181355, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In641181355} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In641181355, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In641181355, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out641181355|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:26:12,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-154075477 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-154075477 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-154075477 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-154075477 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out-154075477| ~y$r_buff1_thd2~0_In-154075477) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite37_Out-154075477| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-154075477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-154075477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-154075477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-154075477} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-154075477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-154075477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-154075477, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-154075477|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-154075477} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:26:12,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:26:12,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:26:12,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1714366664 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1714366664 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1714366664| ~y$w_buff1~0_In-1714366664)) (and (or .cse1 .cse0) (= ~y~0_In-1714366664 |ULTIMATE.start_main_#t~ite40_Out-1714366664|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1714366664, ~y~0=~y~0_In-1714366664, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1714366664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1714366664} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1714366664|, ~y$w_buff1~0=~y$w_buff1~0_In-1714366664, ~y~0=~y~0_In-1714366664, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1714366664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1714366664} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:26:12,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 18:26:12,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1222142501 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1222142501 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1222142501| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1222142501 |ULTIMATE.start_main_#t~ite42_Out-1222142501|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222142501, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1222142501} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222142501, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1222142501, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1222142501|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:26:12,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1489009153 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1489009153 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1489009153 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1489009153 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1489009153| ~y$w_buff1_used~0_In-1489009153)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1489009153| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1489009153, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1489009153, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1489009153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1489009153} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1489009153, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1489009153, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1489009153|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1489009153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1489009153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:26:12,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In40207155 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In40207155 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out40207155| ~y$r_buff0_thd0~0_In40207155)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out40207155|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In40207155, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In40207155} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In40207155, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In40207155, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out40207155|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:26:12,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In716471433 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In716471433 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In716471433 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In716471433 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out716471433|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In716471433 |ULTIMATE.start_main_#t~ite45_Out716471433|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In716471433, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In716471433, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In716471433, ~y$w_buff1_used~0=~y$w_buff1_used~0_In716471433} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In716471433, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In716471433, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In716471433, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out716471433|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In716471433} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:26:12,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:26:12,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:26:12 BasicIcfg [2019-12-07 18:26:12,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:26:12,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:26:12,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:26:12,510 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:26:12,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:25:58" (3/4) ... [2019-12-07 18:26:12,512 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:26:12,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= (select .cse0 |v_ULTIMATE.start_main_~#t589~0.base_29|) 0) (= v_~y$mem_tmp~0_26 0) (= |v_ULTIMATE.start_main_~#t589~0.offset_20| 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t589~0.base_29| 4)) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t589~0.base_29| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t589~0.base_29|) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t589~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t589~0.base_29|) |v_ULTIMATE.start_main_~#t589~0.offset_20| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, ULTIMATE.start_main_~#t590~0.base=|v_ULTIMATE.start_main_~#t590~0.base_17|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ULTIMATE.start_main_~#t590~0.offset=|v_ULTIMATE.start_main_~#t590~0.offset_14|, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t589~0.base=|v_ULTIMATE.start_main_~#t589~0.base_29|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t589~0.offset=|v_ULTIMATE.start_main_~#t589~0.offset_20|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t590~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t590~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t589~0.base, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t589~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:26:12,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t590~0.base_12|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t590~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t590~0.base_12|) |v_ULTIMATE.start_main_~#t590~0.offset_10| 1)) |v_#memory_int_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t590~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t590~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t590~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t590~0.base_12| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t590~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t590~0.offset=|v_ULTIMATE.start_main_~#t590~0.offset_10|, ULTIMATE.start_main_~#t590~0.base=|v_ULTIMATE.start_main_~#t590~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t590~0.offset, ULTIMATE.start_main_~#t590~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 18:26:12,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:26:12,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2120440141 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-2120440141 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2120440141|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-2120440141 |P0Thread1of1ForFork0_#t~ite5_Out-2120440141|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120440141, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2120440141} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2120440141|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120440141, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2120440141} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:26:12,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In183422257 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out183422257| ~y$w_buff0~0_In183422257) (= |P1Thread1of1ForFork1_#t~ite14_In183422257| |P1Thread1of1ForFork1_#t~ite14_Out183422257|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out183422257| |P1Thread1of1ForFork1_#t~ite14_Out183422257|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In183422257 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In183422257 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In183422257 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In183422257 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite14_Out183422257| ~y$w_buff0~0_In183422257)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In183422257, ~y$w_buff0_used~0=~y$w_buff0_used~0_In183422257, ~y$w_buff0~0=~y$w_buff0~0_In183422257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In183422257, ~weak$$choice2~0=~weak$$choice2~0_In183422257, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In183422257|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In183422257} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In183422257, ~y$w_buff0_used~0=~y$w_buff0_used~0_In183422257, ~y$w_buff0~0=~y$w_buff0~0_In183422257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In183422257, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out183422257|, ~weak$$choice2~0=~weak$$choice2~0_In183422257, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out183422257|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In183422257} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 18:26:12,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-168825926 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-168825926| |P1Thread1of1ForFork1_#t~ite17_Out-168825926|) (not .cse0) (= ~y$w_buff1~0_In-168825926 |P1Thread1of1ForFork1_#t~ite18_Out-168825926|)) (and (= ~y$w_buff1~0_In-168825926 |P1Thread1of1ForFork1_#t~ite17_Out-168825926|) (= |P1Thread1of1ForFork1_#t~ite17_Out-168825926| |P1Thread1of1ForFork1_#t~ite18_Out-168825926|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-168825926 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-168825926 256))) (= (mod ~y$w_buff0_used~0_In-168825926 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-168825926 256))))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-168825926, ~y$w_buff1~0=~y$w_buff1~0_In-168825926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-168825926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-168825926, ~weak$$choice2~0=~weak$$choice2~0_In-168825926, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-168825926|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-168825926} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-168825926, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-168825926|, ~y$w_buff1~0=~y$w_buff1~0_In-168825926, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-168825926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-168825926, ~weak$$choice2~0=~weak$$choice2~0_In-168825926, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-168825926|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-168825926} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 18:26:12,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-597797756 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-597797756 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-597797756 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-597797756 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-597797756| ~y$w_buff1_used~0_In-597797756) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out-597797756| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-597797756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-597797756, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-597797756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-597797756} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-597797756|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-597797756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-597797756, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-597797756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-597797756} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:26:12,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In391657435 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In391657435 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out391657435 ~y$r_buff0_thd1~0_In391657435))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out391657435)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In391657435, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In391657435} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In391657435, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out391657435|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out391657435} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:26:12,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1976058199 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1976058199 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1976058199 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1976058199 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1976058199|)) (and (= ~y$r_buff1_thd1~0_In1976058199 |P0Thread1of1ForFork0_#t~ite8_Out1976058199|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1976058199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1976058199, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1976058199, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1976058199} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1976058199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1976058199, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1976058199|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1976058199, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1976058199} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:26:12,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1092865336 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1092865336 256)))) (or (= (mod ~y$w_buff0_used~0_In-1092865336 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1092865336 256)) .cse0) (and .cse0 (= (mod ~y$w_buff1_used~0_In-1092865336 256) 0)))) .cse1 (= ~y$w_buff0_used~0_In-1092865336 |P1Thread1of1ForFork1_#t~ite20_Out-1092865336|) (= |P1Thread1of1ForFork1_#t~ite21_Out-1092865336| |P1Thread1of1ForFork1_#t~ite20_Out-1092865336|)) (and (= ~y$w_buff0_used~0_In-1092865336 |P1Thread1of1ForFork1_#t~ite21_Out-1092865336|) (= |P1Thread1of1ForFork1_#t~ite20_In-1092865336| |P1Thread1of1ForFork1_#t~ite20_Out-1092865336|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1092865336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092865336, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1092865336|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1092865336, ~weak$$choice2~0=~weak$$choice2~0_In-1092865336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092865336} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1092865336, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092865336, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1092865336|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1092865336, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1092865336|, ~weak$$choice2~0=~weak$$choice2~0_In-1092865336, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092865336} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 18:26:12,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:26:12,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1186283447 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1186283447 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1186283447 256)) (and (= (mod ~y$r_buff1_thd2~0_In1186283447 256) 0) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In1186283447 256)) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out1186283447| ~y$r_buff1_thd2~0_In1186283447) (= |P1Thread1of1ForFork1_#t~ite30_Out1186283447| |P1Thread1of1ForFork1_#t~ite29_Out1186283447|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In1186283447| |P1Thread1of1ForFork1_#t~ite29_Out1186283447|) (= |P1Thread1of1ForFork1_#t~ite30_Out1186283447| ~y$r_buff1_thd2~0_In1186283447)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1186283447, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1186283447|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1186283447, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1186283447, ~weak$$choice2~0=~weak$$choice2~0_In1186283447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1186283447} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1186283447, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1186283447|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1186283447|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1186283447, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1186283447, ~weak$$choice2~0=~weak$$choice2~0_In1186283447, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1186283447} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:26:12,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:26:12,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 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_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 18:26:12,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In343263277 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In343263277 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out343263277| ~y~0_In343263277) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out343263277| ~y$w_buff1~0_In343263277) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In343263277, ~y$w_buff1~0=~y$w_buff1~0_In343263277, ~y~0=~y~0_In343263277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In343263277} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In343263277, ~y$w_buff1~0=~y$w_buff1~0_In343263277, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out343263277|, ~y~0=~y~0_In343263277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In343263277} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 18:26:12,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 18:26:12,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In891475039 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In891475039 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out891475039| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out891475039| ~y$w_buff0_used~0_In891475039) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In891475039, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In891475039} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In891475039, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In891475039, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out891475039|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:26:12,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In631549317 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In631549317 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In631549317 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In631549317 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out631549317|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In631549317 |P1Thread1of1ForFork1_#t~ite35_Out631549317|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In631549317, ~y$w_buff0_used~0=~y$w_buff0_used~0_In631549317, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In631549317, ~y$w_buff1_used~0=~y$w_buff1_used~0_In631549317} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In631549317, ~y$w_buff0_used~0=~y$w_buff0_used~0_In631549317, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In631549317, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out631549317|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In631549317} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:26:12,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In641181355 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In641181355 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out641181355| ~y$r_buff0_thd2~0_In641181355) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out641181355| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In641181355, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In641181355} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In641181355, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In641181355, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out641181355|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:26:12,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-154075477 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-154075477 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-154075477 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-154075477 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out-154075477| ~y$r_buff1_thd2~0_In-154075477) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite37_Out-154075477| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-154075477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-154075477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-154075477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-154075477} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-154075477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-154075477, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-154075477, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-154075477|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-154075477} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:26:12,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:26:12,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:26:12,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1714366664 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1714366664 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1714366664| ~y$w_buff1~0_In-1714366664)) (and (or .cse1 .cse0) (= ~y~0_In-1714366664 |ULTIMATE.start_main_#t~ite40_Out-1714366664|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1714366664, ~y~0=~y~0_In-1714366664, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1714366664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1714366664} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1714366664|, ~y$w_buff1~0=~y$w_buff1~0_In-1714366664, ~y~0=~y~0_In-1714366664, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1714366664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1714366664} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:26:12,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 18:26:12,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1222142501 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1222142501 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1222142501| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1222142501 |ULTIMATE.start_main_#t~ite42_Out-1222142501|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222142501, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1222142501} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222142501, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1222142501, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1222142501|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:26:12,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1489009153 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1489009153 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1489009153 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1489009153 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1489009153| ~y$w_buff1_used~0_In-1489009153)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1489009153| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1489009153, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1489009153, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1489009153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1489009153} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1489009153, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1489009153, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1489009153|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1489009153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1489009153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:26:12,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In40207155 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In40207155 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out40207155| ~y$r_buff0_thd0~0_In40207155)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out40207155|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In40207155, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In40207155} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In40207155, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In40207155, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out40207155|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:26:12,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In716471433 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In716471433 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In716471433 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In716471433 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out716471433|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In716471433 |ULTIMATE.start_main_#t~ite45_Out716471433|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In716471433, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In716471433, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In716471433, ~y$w_buff1_used~0=~y$w_buff1_used~0_In716471433} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In716471433, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In716471433, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In716471433, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out716471433|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In716471433} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:26:12,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:26:12,582 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c81dc164-d693-4f97-8d86-a8b44ca5ce0c/bin/uautomizer/witness.graphml [2019-12-07 18:26:12,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:26:12,584 INFO L168 Benchmark]: Toolchain (without parser) took 14690.14 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 395.8 MB). Free memory was 938.1 MB in the beginning and 1.4 GB in the end (delta: -431.5 MB). Peak memory consumption was 479.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:26:12,584 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:26:12,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -127.7 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:26:12,585 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.90 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 18:26:12,585 INFO L168 Benchmark]: Boogie Preprocessor took 26.05 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 18:26:12,586 INFO L168 Benchmark]: RCFGBuilder took 401.74 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.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:26:12,586 INFO L168 Benchmark]: TraceAbstraction took 13752.83 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 235.9 MB). Free memory was 1.0 GB in the beginning and 808.4 MB in the end (delta: 201.2 MB). Peak memory consumption was 437.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:26:12,587 INFO L168 Benchmark]: Witness Printer took 73.09 ms. Allocated memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 61.9 MB). Free memory was 808.4 MB in the beginning and 1.4 GB in the end (delta: -561.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:26:12,589 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 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 387.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -127.7 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.90 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 26.05 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 401.74 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.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13752.83 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 235.9 MB). Free memory was 1.0 GB in the beginning and 808.4 MB in the end (delta: 201.2 MB). Peak memory consumption was 437.1 MB. Max. memory is 11.5 GB. * Witness Printer took 73.09 ms. Allocated memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 61.9 MB). Free memory was 808.4 MB in the beginning and 1.4 GB in the end (delta: -561.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t589, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t590, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L762] 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, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 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) [L763] 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)) [L764] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 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)) [L766] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L766] 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)) [L768] 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)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 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 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2524 SDtfs, 3529 SDslu, 7025 SDs, 0 SdLazy, 6956 SolverSat, 321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 49 SyntacticMatches, 19 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 11217 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 707 NumberOfCodeBlocks, 707 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 637 ConstructedInterpolants, 0 QuantifiedInterpolants, 163077 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...