./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68ce5e2cae6b906213c9a9134a101e1bcfb81755 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-a4ecdab [2020-11-28 02:56:20,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 02:56:20,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 02:56:20,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 02:56:20,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 02:56:20,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 02:56:20,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 02:56:20,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 02:56:20,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 02:56:20,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 02:56:20,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 02:56:20,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 02:56:20,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 02:56:20,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 02:56:20,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 02:56:20,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 02:56:20,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 02:56:20,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 02:56:20,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 02:56:20,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 02:56:20,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 02:56:20,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 02:56:20,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 02:56:20,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 02:56:20,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 02:56:20,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 02:56:20,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 02:56:20,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 02:56:20,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 02:56:20,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 02:56:20,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 02:56:20,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 02:56:20,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 02:56:20,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 02:56:20,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 02:56:20,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 02:56:20,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 02:56:20,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 02:56:20,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 02:56:20,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 02:56:20,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 02:56:20,855 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 02:56:20,879 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 02:56:20,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 02:56:20,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 02:56:20,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 02:56:20,881 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 02:56:20,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 02:56:20,882 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 02:56:20,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 02:56:20,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 02:56:20,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 02:56:20,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 02:56:20,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 02:56:20,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 02:56:20,883 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 02:56:20,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 02:56:20,884 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 02:56:20,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 02:56:20,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 02:56:20,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 02:56:20,885 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 02:56:20,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 02:56:20,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 02:56:20,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 02:56:20,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 02:56:20,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 02:56:20,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 02:56:20,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 02:56:20,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 02:56:20,887 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 02:56:20,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/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(reach_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 -> 68ce5e2cae6b906213c9a9134a101e1bcfb81755 [2020-11-28 02:56:21,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 02:56:21,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 02:56:21,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 02:56:21,142 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 02:56:21,145 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 02:56:21,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix044_pso.opt.i [2020-11-28 02:56:21,215 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/bin/uautomizer/data/37b2b6556/daf56417c48b41339577fce201c3788d/FLAG20f5a5864 [2020-11-28 02:56:21,821 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 02:56:21,822 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/sv-benchmarks/c/pthread-wmm/mix044_pso.opt.i [2020-11-28 02:56:21,836 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/bin/uautomizer/data/37b2b6556/daf56417c48b41339577fce201c3788d/FLAG20f5a5864 [2020-11-28 02:56:22,058 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/bin/uautomizer/data/37b2b6556/daf56417c48b41339577fce201c3788d [2020-11-28 02:56:22,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 02:56:22,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 02:56:22,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 02:56:22,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 02:56:22,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 02:56:22,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b673ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22, skipping insertion in model container [2020-11-28 02:56:22,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 02:56:22,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 02:56:22,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:56:22,599 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 02:56:22,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:56:22,769 INFO L208 MainTranslator]: Completed translation [2020-11-28 02:56:22,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22 WrapperNode [2020-11-28 02:56:22,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 02:56:22,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 02:56:22,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 02:56:22,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 02:56:22,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 02:56:22,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 02:56:22,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 02:56:22,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 02:56:22,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 02:56:22,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 02:56:22,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 02:56:22,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 02:56:22,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/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 [2020-11-28 02:56:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 02:56:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 02:56:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 02:56:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 02:56:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 02:56:23,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 02:56:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 02:56:23,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 02:56:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 02:56:23,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 02:56:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-28 02:56:23,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-28 02:56:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 02:56:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 02:56:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 02:56:23,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 02:56:23,021 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 02:56:25,377 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 02:56:25,377 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 02:56:25,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:25 BoogieIcfgContainer [2020-11-28 02:56:25,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 02:56:25,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 02:56:25,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 02:56:25,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 02:56:25,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:56:22" (1/3) ... [2020-11-28 02:56:25,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180ef196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:56:25, skipping insertion in model container [2020-11-28 02:56:25,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (2/3) ... [2020-11-28 02:56:25,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180ef196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:56:25, skipping insertion in model container [2020-11-28 02:56:25,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:25" (3/3) ... [2020-11-28 02:56:25,388 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_pso.opt.i [2020-11-28 02:56:25,399 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 02:56:25,399 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 02:56:25,403 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 02:56:25,404 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 02:56:25,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,443 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,445 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,445 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,447 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,447 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,451 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,451 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,452 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,454 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,465 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,472 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,473 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,474 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,480 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,484 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 02:56:25,496 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-28 02:56:25,529 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 02:56:25,530 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 02:56:25,530 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 02:56:25,530 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 02:56:25,530 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 02:56:25,530 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 02:56:25,531 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 02:56:25,531 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 02:56:25,549 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 02:56:25,554 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-28 02:56:25,557 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-28 02:56:25,560 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-11-28 02:56:25,634 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-11-28 02:56:25,634 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 02:56:25,640 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-28 02:56:25,647 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-11-28 02:56:25,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:56:25,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:26,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:26,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:26,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,592 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-28 02:56:26,734 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-28 02:56:26,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:26,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:26,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:27,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 02:56:27,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:27,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 02:56:27,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:27,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 02:56:27,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:27,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 02:56:27,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:28,485 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-11-28 02:56:28,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-11-28 02:56:28,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:28,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 02:56:28,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,400 WARN L193 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-11-28 02:56:29,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 02:56:29,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 02:56:29,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 02:56:29,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 02:56:29,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:29,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:29,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:29,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:30,234 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-11-28 02:56:30,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:30,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:30,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:30,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:30,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:30,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:30,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:30,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:30,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:30,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:30,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:30,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:30,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:30,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:30,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:30,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:30,815 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 02:56:31,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:56:31,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:32,629 WARN L193 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-11-28 02:56:32,883 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-11-28 02:56:32,887 INFO L131 LiptonReduction]: Checked pairs total: 7226 [2020-11-28 02:56:32,888 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-11-28 02:56:32,895 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-11-28 02:56:33,143 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-11-28 02:56:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-11-28 02:56:33,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 02:56:33,152 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:33,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:33,153 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:33,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:33,159 INFO L82 PathProgramCache]: Analyzing trace with hash 961632752, now seen corresponding path program 1 times [2020-11-28 02:56:33,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:33,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147002463] [2020-11-28 02:56:33,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:33,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147002463] [2020-11-28 02:56:33,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:33,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 02:56:33,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056074953] [2020-11-28 02:56:33,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:33,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:33,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:33,532 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-11-28 02:56:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:33,784 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-11-28 02:56:33,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:33,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-28 02:56:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:33,844 INFO L225 Difference]: With dead ends: 3082 [2020-11-28 02:56:33,844 INFO L226 Difference]: Without dead ends: 2602 [2020-11-28 02:56:33,847 INFO L677 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 [2020-11-28 02:56:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-11-28 02:56:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-11-28 02:56:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-11-28 02:56:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-11-28 02:56:34,077 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-11-28 02:56:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:34,079 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-11-28 02:56:34,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-11-28 02:56:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 02:56:34,089 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:34,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:34,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 02:56:34,090 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:34,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash 570752080, now seen corresponding path program 1 times [2020-11-28 02:56:34,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:34,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406529479] [2020-11-28 02:56:34,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:34,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406529479] [2020-11-28 02:56:34,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:34,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:56:34,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693989413] [2020-11-28 02:56:34,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:34,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:34,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:34,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:34,254 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-11-28 02:56:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:34,333 INFO L93 Difference]: Finished difference Result 2962 states and 11072 transitions. [2020-11-28 02:56:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:34,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-28 02:56:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:34,359 INFO L225 Difference]: With dead ends: 2962 [2020-11-28 02:56:34,359 INFO L226 Difference]: Without dead ends: 2482 [2020-11-28 02:56:34,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2020-11-28 02:56:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2482. [2020-11-28 02:56:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2020-11-28 02:56:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 9508 transitions. [2020-11-28 02:56:34,478 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 9508 transitions. Word has length 12 [2020-11-28 02:56:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:34,479 INFO L481 AbstractCegarLoop]: Abstraction has 2482 states and 9508 transitions. [2020-11-28 02:56:34,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 9508 transitions. [2020-11-28 02:56:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 02:56:34,481 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:34,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:34,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 02:56:34,482 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:34,492 INFO L82 PathProgramCache]: Analyzing trace with hash 66316442, now seen corresponding path program 1 times [2020-11-28 02:56:34,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:34,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142722754] [2020-11-28 02:56:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:34,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142722754] [2020-11-28 02:56:34,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:34,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:56:34,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358719882] [2020-11-28 02:56:34,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:34,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:34,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:34,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:34,700 INFO L87 Difference]: Start difference. First operand 2482 states and 9508 transitions. Second operand 4 states. [2020-11-28 02:56:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:34,847 INFO L93 Difference]: Finished difference Result 2762 states and 10272 transitions. [2020-11-28 02:56:34,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:34,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-28 02:56:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:34,874 INFO L225 Difference]: With dead ends: 2762 [2020-11-28 02:56:34,874 INFO L226 Difference]: Without dead ends: 2342 [2020-11-28 02:56:34,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2020-11-28 02:56:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2342. [2020-11-28 02:56:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2342 states. [2020-11-28 02:56:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 8916 transitions. [2020-11-28 02:56:34,981 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 8916 transitions. Word has length 13 [2020-11-28 02:56:34,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:34,981 INFO L481 AbstractCegarLoop]: Abstraction has 2342 states and 8916 transitions. [2020-11-28 02:56:34,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 8916 transitions. [2020-11-28 02:56:34,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 02:56:34,984 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:34,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:34,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 02:56:34,985 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:34,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:34,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2064368680, now seen corresponding path program 1 times [2020-11-28 02:56:34,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:34,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341023279] [2020-11-28 02:56:34,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:35,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341023279] [2020-11-28 02:56:35,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:35,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:56:35,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168244130] [2020-11-28 02:56:35,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 02:56:35,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:35,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 02:56:35,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:35,222 INFO L87 Difference]: Start difference. First operand 2342 states and 8916 transitions. Second operand 6 states. [2020-11-28 02:56:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:35,412 INFO L93 Difference]: Finished difference Result 2732 states and 10108 transitions. [2020-11-28 02:56:35,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:56:35,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-28 02:56:35,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:35,436 INFO L225 Difference]: With dead ends: 2732 [2020-11-28 02:56:35,437 INFO L226 Difference]: Without dead ends: 2354 [2020-11-28 02:56:35,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2020-11-28 02:56:35,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2354. [2020-11-28 02:56:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2354 states. [2020-11-28 02:56:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 8896 transitions. [2020-11-28 02:56:35,600 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 8896 transitions. Word has length 14 [2020-11-28 02:56:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:35,600 INFO L481 AbstractCegarLoop]: Abstraction has 2354 states and 8896 transitions. [2020-11-28 02:56:35,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 02:56:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 8896 transitions. [2020-11-28 02:56:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 02:56:35,604 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:35,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:35,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 02:56:35,605 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash -429123293, now seen corresponding path program 1 times [2020-11-28 02:56:35,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:35,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145401796] [2020-11-28 02:56:35,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:35,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145401796] [2020-11-28 02:56:35,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:35,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:56:35,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72859461] [2020-11-28 02:56:35,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 02:56:35,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:35,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 02:56:35,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:35,770 INFO L87 Difference]: Start difference. First operand 2354 states and 8896 transitions. Second operand 6 states. [2020-11-28 02:56:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:35,929 INFO L93 Difference]: Finished difference Result 2522 states and 9290 transitions. [2020-11-28 02:56:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:56:35,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-28 02:56:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:35,955 INFO L225 Difference]: With dead ends: 2522 [2020-11-28 02:56:35,955 INFO L226 Difference]: Without dead ends: 2242 [2020-11-28 02:56:35,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-28 02:56:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2020-11-28 02:56:36,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2020-11-28 02:56:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2020-11-28 02:56:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 8400 transitions. [2020-11-28 02:56:36,053 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 8400 transitions. Word has length 15 [2020-11-28 02:56:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:36,053 INFO L481 AbstractCegarLoop]: Abstraction has 2242 states and 8400 transitions. [2020-11-28 02:56:36,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 02:56:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 8400 transitions. [2020-11-28 02:56:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 02:56:36,058 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:36,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:36,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 02:56:36,059 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:36,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:36,059 INFO L82 PathProgramCache]: Analyzing trace with hash -857925543, now seen corresponding path program 1 times [2020-11-28 02:56:36,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:36,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845729852] [2020-11-28 02:56:36,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:36,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845729852] [2020-11-28 02:56:36,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:36,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:56:36,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317458394] [2020-11-28 02:56:36,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:36,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:36,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:36,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:36,138 INFO L87 Difference]: Start difference. First operand 2242 states and 8400 transitions. Second operand 4 states. [2020-11-28 02:56:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:36,178 INFO L93 Difference]: Finished difference Result 2326 states and 8590 transitions. [2020-11-28 02:56:36,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:36,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-28 02:56:36,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:36,201 INFO L225 Difference]: With dead ends: 2326 [2020-11-28 02:56:36,201 INFO L226 Difference]: Without dead ends: 2186 [2020-11-28 02:56:36,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2020-11-28 02:56:36,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2090. [2020-11-28 02:56:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-11-28 02:56:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7828 transitions. [2020-11-28 02:56:36,310 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7828 transitions. Word has length 17 [2020-11-28 02:56:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:36,310 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7828 transitions. [2020-11-28 02:56:36,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7828 transitions. [2020-11-28 02:56:36,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 02:56:36,317 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:36,317 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:36,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 02:56:36,317 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:36,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:36,318 INFO L82 PathProgramCache]: Analyzing trace with hash -793569295, now seen corresponding path program 1 times [2020-11-28 02:56:36,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:36,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303272865] [2020-11-28 02:56:36,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:36,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303272865] [2020-11-28 02:56:36,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:36,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:56:36,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513138593] [2020-11-28 02:56:36,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 02:56:36,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 02:56:36,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:36,486 INFO L87 Difference]: Start difference. First operand 2090 states and 7828 transitions. Second operand 7 states. [2020-11-28 02:56:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:36,631 INFO L93 Difference]: Finished difference Result 2618 states and 9758 transitions. [2020-11-28 02:56:36,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 02:56:36,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-11-28 02:56:36,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:36,645 INFO L225 Difference]: With dead ends: 2618 [2020-11-28 02:56:36,645 INFO L226 Difference]: Without dead ends: 2450 [2020-11-28 02:56:36,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:56:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-11-28 02:56:36,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2250. [2020-11-28 02:56:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2250 states. [2020-11-28 02:56:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 8484 transitions. [2020-11-28 02:56:36,739 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 8484 transitions. Word has length 17 [2020-11-28 02:56:36,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:36,739 INFO L481 AbstractCegarLoop]: Abstraction has 2250 states and 8484 transitions. [2020-11-28 02:56:36,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 02:56:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 8484 transitions. [2020-11-28 02:56:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 02:56:36,744 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:36,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:36,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 02:56:36,745 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:36,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:36,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1058113375, now seen corresponding path program 2 times [2020-11-28 02:56:36,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:36,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515003213] [2020-11-28 02:56:36,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:36,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515003213] [2020-11-28 02:56:36,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:36,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:56:36,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845607233] [2020-11-28 02:56:36,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 02:56:36,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:36,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 02:56:36,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:36,879 INFO L87 Difference]: Start difference. First operand 2250 states and 8484 transitions. Second operand 7 states. [2020-11-28 02:56:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:37,082 INFO L93 Difference]: Finished difference Result 2618 states and 9688 transitions. [2020-11-28 02:56:37,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:56:37,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-11-28 02:56:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:37,095 INFO L225 Difference]: With dead ends: 2618 [2020-11-28 02:56:37,095 INFO L226 Difference]: Without dead ends: 2394 [2020-11-28 02:56:37,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-11-28 02:56:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2020-11-28 02:56:37,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2130. [2020-11-28 02:56:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2020-11-28 02:56:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 7932 transitions. [2020-11-28 02:56:37,219 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 7932 transitions. Word has length 17 [2020-11-28 02:56:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:37,220 INFO L481 AbstractCegarLoop]: Abstraction has 2130 states and 7932 transitions. [2020-11-28 02:56:37,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 02:56:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 7932 transitions. [2020-11-28 02:56:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 02:56:37,225 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:37,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:37,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 02:56:37,225 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:37,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash -71966300, now seen corresponding path program 1 times [2020-11-28 02:56:37,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:37,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780503608] [2020-11-28 02:56:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:37,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780503608] [2020-11-28 02:56:37,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:37,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:37,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481456620] [2020-11-28 02:56:37,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:37,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:37,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:37,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:37,342 INFO L87 Difference]: Start difference. First operand 2130 states and 7932 transitions. Second operand 4 states. [2020-11-28 02:56:37,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:37,415 INFO L93 Difference]: Finished difference Result 2180 states and 7411 transitions. [2020-11-28 02:56:37,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:37,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-28 02:56:37,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:37,424 INFO L225 Difference]: With dead ends: 2180 [2020-11-28 02:56:37,424 INFO L226 Difference]: Without dead ends: 1668 [2020-11-28 02:56:37,424 INFO L677 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 [2020-11-28 02:56:37,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2020-11-28 02:56:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2020-11-28 02:56:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2020-11-28 02:56:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 5622 transitions. [2020-11-28 02:56:37,484 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 5622 transitions. Word has length 17 [2020-11-28 02:56:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:37,485 INFO L481 AbstractCegarLoop]: Abstraction has 1668 states and 5622 transitions. [2020-11-28 02:56:37,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 5622 transitions. [2020-11-28 02:56:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 02:56:37,490 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:37,490 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:37,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 02:56:37,490 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:37,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1706288293, now seen corresponding path program 1 times [2020-11-28 02:56:37,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:37,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098110421] [2020-11-28 02:56:37,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:37,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:37,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098110421] [2020-11-28 02:56:37,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:37,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:56:37,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261358462] [2020-11-28 02:56:37,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:56:37,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:37,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:56:37,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:37,606 INFO L87 Difference]: Start difference. First operand 1668 states and 5622 transitions. Second operand 5 states. [2020-11-28 02:56:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:37,675 INFO L93 Difference]: Finished difference Result 1389 states and 4274 transitions. [2020-11-28 02:56:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:56:37,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-28 02:56:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:37,680 INFO L225 Difference]: With dead ends: 1389 [2020-11-28 02:56:37,680 INFO L226 Difference]: Without dead ends: 1066 [2020-11-28 02:56:37,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2020-11-28 02:56:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1066. [2020-11-28 02:56:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2020-11-28 02:56:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 3214 transitions. [2020-11-28 02:56:37,713 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 3214 transitions. Word has length 18 [2020-11-28 02:56:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:37,714 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 3214 transitions. [2020-11-28 02:56:37,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:56:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 3214 transitions. [2020-11-28 02:56:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 02:56:37,717 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:37,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:37,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 02:56:37,718 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:37,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:37,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1034534510, now seen corresponding path program 1 times [2020-11-28 02:56:37,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:37,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190823248] [2020-11-28 02:56:37,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:37,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190823248] [2020-11-28 02:56:37,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:37,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-28 02:56:37,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492249687] [2020-11-28 02:56:37,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 02:56:37,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:37,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 02:56:37,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:56:37,939 INFO L87 Difference]: Start difference. First operand 1066 states and 3214 transitions. Second operand 9 states. [2020-11-28 02:56:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:38,268 INFO L93 Difference]: Finished difference Result 1709 states and 5053 transitions. [2020-11-28 02:56:38,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-28 02:56:38,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-11-28 02:56:38,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:38,272 INFO L225 Difference]: With dead ends: 1709 [2020-11-28 02:56:38,273 INFO L226 Difference]: Without dead ends: 1282 [2020-11-28 02:56:38,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-11-28 02:56:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2020-11-28 02:56:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1226. [2020-11-28 02:56:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2020-11-28 02:56:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 3643 transitions. [2020-11-28 02:56:38,310 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 3643 transitions. Word has length 20 [2020-11-28 02:56:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:38,310 INFO L481 AbstractCegarLoop]: Abstraction has 1226 states and 3643 transitions. [2020-11-28 02:56:38,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 02:56:38,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 3643 transitions. [2020-11-28 02:56:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 02:56:38,314 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:38,314 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:38,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 02:56:38,314 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:38,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:38,315 INFO L82 PathProgramCache]: Analyzing trace with hash 156009029, now seen corresponding path program 1 times [2020-11-28 02:56:38,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:38,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876111054] [2020-11-28 02:56:38,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:38,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876111054] [2020-11-28 02:56:38,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:38,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:56:38,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021745466] [2020-11-28 02:56:38,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 02:56:38,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:38,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 02:56:38,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:38,429 INFO L87 Difference]: Start difference. First operand 1226 states and 3643 transitions. Second operand 6 states. [2020-11-28 02:56:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:38,506 INFO L93 Difference]: Finished difference Result 1027 states and 3009 transitions. [2020-11-28 02:56:38,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 02:56:38,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-28 02:56:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:38,510 INFO L225 Difference]: With dead ends: 1027 [2020-11-28 02:56:38,510 INFO L226 Difference]: Without dead ends: 900 [2020-11-28 02:56:38,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2020-11-28 02:56:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2020-11-28 02:56:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2020-11-28 02:56:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2677 transitions. [2020-11-28 02:56:38,539 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 2677 transitions. Word has length 20 [2020-11-28 02:56:38,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:38,539 INFO L481 AbstractCegarLoop]: Abstraction has 900 states and 2677 transitions. [2020-11-28 02:56:38,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 02:56:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 2677 transitions. [2020-11-28 02:56:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 02:56:38,542 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:38,542 INFO L422 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] [2020-11-28 02:56:38,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 02:56:38,543 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:38,543 INFO L82 PathProgramCache]: Analyzing trace with hash -976237470, now seen corresponding path program 1 times [2020-11-28 02:56:38,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:38,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131548133] [2020-11-28 02:56:38,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:38,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131548133] [2020-11-28 02:56:38,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:38,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:56:38,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330106641] [2020-11-28 02:56:38,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 02:56:38,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:38,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 02:56:38,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:38,649 INFO L87 Difference]: Start difference. First operand 900 states and 2677 transitions. Second operand 6 states. [2020-11-28 02:56:38,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:38,724 INFO L93 Difference]: Finished difference Result 1273 states and 3651 transitions. [2020-11-28 02:56:38,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:56:38,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-11-28 02:56:38,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:38,728 INFO L225 Difference]: With dead ends: 1273 [2020-11-28 02:56:38,728 INFO L226 Difference]: Without dead ends: 872 [2020-11-28 02:56:38,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-28 02:56:38,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2020-11-28 02:56:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 856. [2020-11-28 02:56:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2020-11-28 02:56:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 2381 transitions. [2020-11-28 02:56:38,752 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 2381 transitions. Word has length 23 [2020-11-28 02:56:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:38,754 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 2381 transitions. [2020-11-28 02:56:38,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 02:56:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 2381 transitions. [2020-11-28 02:56:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 02:56:38,757 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:38,757 INFO L422 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] [2020-11-28 02:56:38,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 02:56:38,758 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:38,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1733612712, now seen corresponding path program 2 times [2020-11-28 02:56:38,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:38,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299775001] [2020-11-28 02:56:38,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:38,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299775001] [2020-11-28 02:56:38,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:38,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:56:38,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541023312] [2020-11-28 02:56:38,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 02:56:38,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:38,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 02:56:38,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:38,894 INFO L87 Difference]: Start difference. First operand 856 states and 2381 transitions. Second operand 7 states. [2020-11-28 02:56:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:38,975 INFO L93 Difference]: Finished difference Result 1097 states and 2982 transitions. [2020-11-28 02:56:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:56:38,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-28 02:56:38,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:38,978 INFO L225 Difference]: With dead ends: 1097 [2020-11-28 02:56:38,978 INFO L226 Difference]: Without dead ends: 781 [2020-11-28 02:56:38,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-28 02:56:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2020-11-28 02:56:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 681. [2020-11-28 02:56:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2020-11-28 02:56:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1824 transitions. [2020-11-28 02:56:38,999 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1824 transitions. Word has length 23 [2020-11-28 02:56:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:38,999 INFO L481 AbstractCegarLoop]: Abstraction has 681 states and 1824 transitions. [2020-11-28 02:56:38,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 02:56:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1824 transitions. [2020-11-28 02:56:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 02:56:39,001 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:39,001 INFO L422 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] [2020-11-28 02:56:39,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 02:56:39,002 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1592607910, now seen corresponding path program 3 times [2020-11-28 02:56:39,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:39,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080698689] [2020-11-28 02:56:39,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:39,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080698689] [2020-11-28 02:56:39,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:39,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 02:56:39,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945380382] [2020-11-28 02:56:39,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 02:56:39,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 02:56:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:39,115 INFO L87 Difference]: Start difference. First operand 681 states and 1824 transitions. Second operand 7 states. [2020-11-28 02:56:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:39,204 INFO L93 Difference]: Finished difference Result 642 states and 1746 transitions. [2020-11-28 02:56:39,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:56:39,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-28 02:56:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:39,206 INFO L225 Difference]: With dead ends: 642 [2020-11-28 02:56:39,206 INFO L226 Difference]: Without dead ends: 205 [2020-11-28 02:56:39,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-28 02:56:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-11-28 02:56:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2020-11-28 02:56:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-11-28 02:56:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 455 transitions. [2020-11-28 02:56:39,212 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 455 transitions. Word has length 23 [2020-11-28 02:56:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:39,213 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 455 transitions. [2020-11-28 02:56:39,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 02:56:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 455 transitions. [2020-11-28 02:56:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 02:56:39,214 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:39,214 INFO L422 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] [2020-11-28 02:56:39,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 02:56:39,215 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:39,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:39,215 INFO L82 PathProgramCache]: Analyzing trace with hash 955261625, now seen corresponding path program 1 times [2020-11-28 02:56:39,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:39,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471204976] [2020-11-28 02:56:39,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:39,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471204976] [2020-11-28 02:56:39,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:39,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 02:56:39,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862478199] [2020-11-28 02:56:39,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 02:56:39,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:39,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 02:56:39,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-28 02:56:39,389 INFO L87 Difference]: Start difference. First operand 185 states and 455 transitions. Second operand 8 states. [2020-11-28 02:56:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:39,514 INFO L93 Difference]: Finished difference Result 236 states and 574 transitions. [2020-11-28 02:56:39,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:56:39,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-11-28 02:56:39,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:39,515 INFO L225 Difference]: With dead ends: 236 [2020-11-28 02:56:39,515 INFO L226 Difference]: Without dead ends: 93 [2020-11-28 02:56:39,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-28 02:56:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-28 02:56:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-11-28 02:56:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-28 02:56:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 199 transitions. [2020-11-28 02:56:39,519 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 199 transitions. Word has length 27 [2020-11-28 02:56:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:39,519 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 199 transitions. [2020-11-28 02:56:39,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 02:56:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 199 transitions. [2020-11-28 02:56:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 02:56:39,520 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:39,520 INFO L422 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] [2020-11-28 02:56:39,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 02:56:39,520 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:39,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:39,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1748049593, now seen corresponding path program 2 times [2020-11-28 02:56:39,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:39,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645148966] [2020-11-28 02:56:39,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:39,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645148966] [2020-11-28 02:56:39,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:39,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 02:56:39,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578655020] [2020-11-28 02:56:39,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 02:56:39,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:39,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 02:56:39,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-28 02:56:39,792 INFO L87 Difference]: Start difference. First operand 93 states and 199 transitions. Second operand 8 states. [2020-11-28 02:56:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:40,030 INFO L93 Difference]: Finished difference Result 140 states and 290 transitions. [2020-11-28 02:56:40,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 02:56:40,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-11-28 02:56:40,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:40,031 INFO L225 Difference]: With dead ends: 140 [2020-11-28 02:56:40,031 INFO L226 Difference]: Without dead ends: 85 [2020-11-28 02:56:40,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-11-28 02:56:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-28 02:56:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2020-11-28 02:56:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-28 02:56:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-11-28 02:56:40,034 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 27 [2020-11-28 02:56:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:40,034 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-11-28 02:56:40,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 02:56:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-11-28 02:56:40,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 02:56:40,035 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:40,035 INFO L422 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] [2020-11-28 02:56:40,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 02:56:40,035 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:40,036 INFO L82 PathProgramCache]: Analyzing trace with hash -370388729, now seen corresponding path program 3 times [2020-11-28 02:56:40,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:40,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407331953] [2020-11-28 02:56:40,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:56:40,091 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:56:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:56:40,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:56:40,187 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:56:40,189 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 02:56:40,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 02:56:40,221 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,221 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,221 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,222 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [801] [2020-11-28 02:56:40,224 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,225 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,225 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,225 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,225 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,226 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,226 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,226 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,227 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,227 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,227 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,227 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,228 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,229 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,229 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,229 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,230 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,230 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,236 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,236 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,236 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,237 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,237 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,237 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,238 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,238 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,239 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,239 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,240 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,240 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,240 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:56:40 BasicIcfg [2020-11-28 02:56:40,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 02:56:40,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 02:56:40,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 02:56:40,361 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 02:56:40,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:25" (3/4) ... [2020-11-28 02:56:40,364 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 02:56:40,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,380 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [801] [2020-11-28 02:56:40,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,384 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,385 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,386 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:40,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:40,521 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c2875034-381c-4e9e-ab3a-7b34fdfbcbe5/bin/uautomizer/witness.graphml [2020-11-28 02:56:40,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 02:56:40,522 INFO L168 Benchmark]: Toolchain (without parser) took 18459.77 ms. Allocated memory was 96.5 MB in the beginning and 394.3 MB in the end (delta: 297.8 MB). Free memory was 65.3 MB in the beginning and 182.5 MB in the end (delta: -117.2 MB). Peak memory consumption was 181.3 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:40,522 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 96.5 MB. Free memory is still 56.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 02:56:40,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.97 ms. Allocated memory is still 96.5 MB. Free memory was 65.3 MB in the beginning and 48.6 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:40,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.68 ms. Allocated memory is still 96.5 MB. Free memory was 48.6 MB in the beginning and 45.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:40,523 INFO L168 Benchmark]: Boogie Preprocessor took 77.70 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 45.8 MB in the beginning and 94.3 MB in the end (delta: -48.5 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:40,524 INFO L168 Benchmark]: RCFGBuilder took 2451.19 ms. Allocated memory was 117.4 MB in the beginning and 142.6 MB in the end (delta: 25.2 MB). Free memory was 94.3 MB in the beginning and 77.0 MB in the end (delta: 17.3 MB). Peak memory consumption was 61.9 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:40,524 INFO L168 Benchmark]: TraceAbstraction took 14979.40 ms. Allocated memory was 142.6 MB in the beginning and 394.3 MB in the end (delta: 251.7 MB). Free memory was 77.0 MB in the beginning and 203.5 MB in the end (delta: -126.5 MB). Peak memory consumption was 125.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:40,525 INFO L168 Benchmark]: Witness Printer took 160.02 ms. Allocated memory is still 394.3 MB. Free memory was 203.5 MB in the beginning and 182.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:40,527 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 96.5 MB. Free memory is still 56.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 702.97 ms. Allocated memory is still 96.5 MB. Free memory was 65.3 MB in the beginning and 48.6 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.68 ms. Allocated memory is still 96.5 MB. Free memory was 48.6 MB in the beginning and 45.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 77.70 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 45.8 MB in the beginning and 94.3 MB in the end (delta: -48.5 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2451.19 ms. Allocated memory was 117.4 MB in the beginning and 142.6 MB in the end (delta: 25.2 MB). Free memory was 94.3 MB in the beginning and 77.0 MB in the end (delta: 17.3 MB). Peak memory consumption was 61.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14979.40 ms. Allocated memory was 142.6 MB in the beginning and 394.3 MB in the end (delta: 251.7 MB). Free memory was 77.0 MB in the beginning and 203.5 MB in the end (delta: -126.5 MB). Peak memory consumption was 125.1 MB. Max. memory is 16.1 GB. * Witness Printer took 160.02 ms. Allocated memory is still 394.3 MB. Free memory was 203.5 MB in the beginning and 182.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1889 VarBasedMoverChecksPositive, 69 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 238 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.3s, 131 PlacesBefore, 46 PlacesAfterwards, 121 TransitionsBefore, 34 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 7226 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1173; [L847] FCALL, FORK 0 pthread_create(&t1173, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1174; [L849] FCALL, FORK 0 pthread_create(&t1174, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1175; [L851] FCALL, FORK 0 pthread_create(&t1175, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1176; [L853] FCALL, FORK 0 pthread_create(&t1176, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix044_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L782] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix044_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 726 SDtfs, 921 SDslu, 1618 SDs, 0 SdLazy, 568 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred 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: 1.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 772 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 36515 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, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...