./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-2_1-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d33ed3964fbf386a4716c7606f8248aeb4af19fd ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:45:53,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:45:53,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:45:53,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:45:53,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:45:53,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:45:53,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:45:53,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:45:53,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:45:53,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:45:53,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:45:53,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:45:53,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:45:53,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:45:53,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:45:53,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:45:53,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:45:53,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:45:53,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:45:53,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:45:53,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:45:53,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:45:53,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:45:53,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:45:53,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:45:53,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:45:53,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:45:53,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:45:53,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:45:53,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:45:53,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:45:53,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:45:53,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:45:53,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:45:53,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:45:53,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:45:53,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:45:53,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:45:53,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:45:53,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:45:53,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:45:53,942 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:45:53,951 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:45:53,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:45:53,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:45:53,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:45:53,953 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:45:53,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:45:53,953 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:45:53,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:45:53,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:45:53,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:45:53,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:45:53,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:45:53,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:45:53,954 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:45:53,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:45:53,954 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:45:53,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:45:53,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:45:53,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:45:53,955 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:45:53,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:45:53,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:45:53,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:45:53,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:45:53,955 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:45:53,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:45:53,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:45:53,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:45:53,956 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:45:53,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d33ed3964fbf386a4716c7606f8248aeb4af19fd [2019-12-07 10:45:54,053 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:45:54,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:45:54,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:45:54,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:45:54,068 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:45:54,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer/../../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2019-12-07 10:45:54,111 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer/data/bd33213d1/e0fd869579f247dfa6bb1cef895fce24/FLAG5f2be4171 [2019-12-07 10:45:54,610 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:45:54,611 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2019-12-07 10:45:54,625 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer/data/bd33213d1/e0fd869579f247dfa6bb1cef895fce24/FLAG5f2be4171 [2019-12-07 10:45:55,141 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer/data/bd33213d1/e0fd869579f247dfa6bb1cef895fce24 [2019-12-07 10:45:55,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:45:55,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:45:55,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:45:55,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:45:55,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:45:55,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:45:55" (1/1) ... [2019-12-07 10:45:55,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d02537e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:55, skipping insertion in model container [2019-12-07 10:45:55,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:45:55" (1/1) ... [2019-12-07 10:45:55,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:45:55,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:45:55,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:45:55,680 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:45:55,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:45:55,902 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:45:55,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:55 WrapperNode [2019-12-07 10:45:55,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:45:55,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:45:55,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:45:55,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:45:55,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:55" (1/1) ... [2019-12-07 10:45:55,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:55" (1/1) ... [2019-12-07 10:45:55,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:45:55,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:45:55,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:45:55,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:45:55,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:55" (1/1) ... [2019-12-07 10:45:55,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:55" (1/1) ... [2019-12-07 10:45:55,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:55" (1/1) ... [2019-12-07 10:45:55,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:55" (1/1) ... [2019-12-07 10:45:55,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:55" (1/1) ... [2019-12-07 10:45:55,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:55" (1/1) ... [2019-12-07 10:45:55,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:55" (1/1) ... [2019-12-07 10:45:55,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:45:55,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:45:55,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:45:55,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:45:55,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:45:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:45:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:45:56,026 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-07 10:45:56,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:45:56,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:45:56,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:45:56,026 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2019-12-07 10:45:56,026 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2019-12-07 10:45:56,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:45:56,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:45:56,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 10:45:56,028 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 10:45:56,464 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:45:56,464 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-12-07 10:45:56,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:45:56 BoogieIcfgContainer [2019-12-07 10:45:56,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:45:56,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:45:56,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:45:56,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:45:56,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:45:55" (1/3) ... [2019-12-07 10:45:56,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245d0cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:45:56, skipping insertion in model container [2019-12-07 10:45:56,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:45:55" (2/3) ... [2019-12-07 10:45:56,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245d0cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:45:56, skipping insertion in model container [2019-12-07 10:45:56,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:45:56" (3/3) ... [2019-12-07 10:45:56,470 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2019-12-07 10:45:56,476 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:45:56,476 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:45:56,481 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-12-07 10:45:56,481 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:45:56,501 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,502 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,502 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,502 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,502 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,502 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,503 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,503 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,503 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,503 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,503 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,503 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,503 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,503 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,504 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,504 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,504 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,504 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,504 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,504 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,504 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,505 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,505 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,505 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,505 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,505 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,505 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,506 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,506 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,506 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,506 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,506 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,506 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,506 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,507 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,507 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,507 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,507 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,507 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,508 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,508 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,508 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,508 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,508 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,508 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,508 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,508 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,509 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,509 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,509 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,509 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,509 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,509 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,509 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,509 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,509 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,510 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,510 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,510 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,510 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,510 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,510 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,510 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,511 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,511 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,511 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,511 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,511 WARN L315 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,511 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,512 WARN L315 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:45:56,533 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-07 10:45:56,546 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:45:56,546 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:45:56,546 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:45:56,546 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:45:56,546 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:45:56,547 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:45:56,547 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:45:56,547 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:45:56,558 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 155 transitions [2019-12-07 10:45:56,559 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions [2019-12-07 10:45:56,609 INFO L134 PetriNetUnfolder]: 11/193 cut-off events. [2019-12-07 10:45:56,609 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:45:56,614 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 415 event pairs. 21/194 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-07 10:45:56,619 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions [2019-12-07 10:45:56,645 INFO L134 PetriNetUnfolder]: 11/193 cut-off events. [2019-12-07 10:45:56,645 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:45:56,646 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 415 event pairs. 21/194 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2019-12-07 10:45:56,650 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2884 [2019-12-07 10:45:56,651 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:45:56,737 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:56,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:56,770 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:56,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:56,793 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:56,794 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-07 10:45:56,806 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:56,836 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:56,840 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:56,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:56,870 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:56,870 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-07 10:45:58,919 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:58,955 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:58,960 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:58,986 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:58,987 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:58,987 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-07 10:45:59,007 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:59,035 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:59,040 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:59,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:45:59,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:45:59,064 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:01,344 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:01,370 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:01,374 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:01,402 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:01,403 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:01,403 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-07 10:46:01,415 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:01,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:01,447 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:01,470 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:01,471 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:01,471 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:03,536 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:03,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:03,571 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:03,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:03,600 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:03,600 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-07 10:46:03,610 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:03,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:03,644 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:03,667 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:03,668 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:03,668 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-07 10:46:05,846 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:05,876 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:05,880 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:05,905 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:05,906 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:05,906 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:05,915 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:05,941 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:05,945 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:05,968 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:05,969 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:05,969 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-07 10:46:08,434 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:08,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:08,478 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:08,507 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:08,507 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:08,508 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-07 10:46:08,518 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:08,550 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:08,553 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:08,580 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:08,581 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:08,581 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-07 10:46:10,594 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:10,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:10,626 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:10,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:10,654 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:10,654 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:10,667 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:10,692 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:10,696 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:10,720 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:10,720 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:10,721 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-07 10:46:12,735 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:12,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:12,765 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:12,790 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:12,791 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:12,791 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-07 10:46:12,800 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:12,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:12,835 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:12,862 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:12,862 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:12,862 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:15,053 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:15,084 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:15,087 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:15,116 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:15,116 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:15,117 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-07 10:46:15,126 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:15,164 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:15,168 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:15,197 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:15,198 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:15,198 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-07 10:46:17,384 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:17,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:17,429 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:17,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:17,459 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:17,459 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2019-12-07 10:46:17,469 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:17,501 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:17,504 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:17,531 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:17,532 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:17,532 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-07 10:46:19,687 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:19,720 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:19,724 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:19,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:19,762 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:19,762 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:19,771 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:19,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:19,805 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:19,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:19,835 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:19,835 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:22,136 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:22,167 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:22,171 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:22,201 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:22,202 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:22,202 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:22,213 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:22,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:22,253 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:22,288 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:22,289 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:22,289 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:24,301 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:24,333 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:24,337 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:24,365 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:24,366 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:24,366 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:24,375 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:24,411 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:24,415 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:24,446 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:24,446 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:24,446 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:26,540 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:26,576 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:26,579 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:26,609 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:26,610 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:26,610 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:26,619 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:26,652 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:26,656 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:26,682 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:26,683 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:26,683 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:28,972 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:29,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:29,006 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:29,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:29,033 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:29,033 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2019-12-07 10:46:29,043 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:29,071 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:29,075 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:29,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:29,101 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:29,101 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:31,184 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:31,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:31,220 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:31,258 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:31,258 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:31,259 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:31,268 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:31,301 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:31,304 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:31,330 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:31,331 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:31,331 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2019-12-07 10:46:33,382 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:33,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:33,409 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:33,428 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:33,428 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:33,428 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2019-12-07 10:46:33,498 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:33,523 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:33,526 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:33,549 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:33,549 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:33,549 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-07 10:46:33,558 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:33,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:33,590 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:33,618 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:33,619 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:33,619 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-07 10:46:35,871 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:35,897 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:35,900 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:35,925 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:35,926 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:35,926 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-07 10:46:35,936 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:35,963 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:35,967 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:35,990 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:35,991 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:35,991 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2019-12-07 10:46:38,018 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:38,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:38,054 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:38,080 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:38,081 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:38,081 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-07 10:46:38,089 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:38,116 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:38,120 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:38,144 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:38,145 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:38,145 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2019-12-07 10:46:38,159 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:38,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:38,193 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:38,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:38,217 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:38,217 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-07 10:46:38,225 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:38,251 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:38,254 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:38,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:38,277 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:38,277 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-07 10:46:40,351 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:40,378 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:40,381 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:40,405 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:40,406 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:40,406 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-07 10:46:40,415 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:40,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:40,446 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:40,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:40,472 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:40,473 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2019-12-07 10:46:42,569 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:42,596 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:42,599 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:42,623 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:42,623 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:42,624 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2019-12-07 10:46:42,632 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:42,659 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:42,662 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:42,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:42,689 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:42,689 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-07 10:46:45,632 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-07 10:46:45,694 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:45,726 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:45,731 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:45,759 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:45,759 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:45,759 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2019-12-07 10:46:45,768 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:45,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:45,797 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:45,818 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:45,819 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:45,819 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2019-12-07 10:46:45,830 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:45,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:45,860 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:45,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:45,884 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:45,884 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-07 10:46:45,893 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:45,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:45,922 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:45,944 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:45,944 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:45,944 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2019-12-07 10:46:48,445 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-07 10:46:48,942 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-12-07 10:46:49,086 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-12-07 10:46:49,714 WARN L192 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2019-12-07 10:46:49,723 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:49,951 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-07 10:46:49,952 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:49,957 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:50,152 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 10:46:50,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:50,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:50,153 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:250, output treesize:222 [2019-12-07 10:46:50,358 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 10:46:51,496 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 133 DAG size of output: 128 [2019-12-07 10:46:51,510 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:51,978 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-07 10:46:51,978 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:51,985 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:52,495 WARN L192 SmtUtils]: Spent 509.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-07 10:46:52,495 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:46:52,496 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 10:46:52,496 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2019-12-07 10:46:52,937 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-07 10:46:53,168 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-07 10:46:53,390 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-12-07 10:46:53,398 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5217 [2019-12-07 10:46:53,399 INFO L214 etLargeBlockEncoding]: Total number of compositions: 160 [2019-12-07 10:46:53,401 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 41 transitions [2019-12-07 10:46:53,424 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 462 states. [2019-12-07 10:46:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states. [2019-12-07 10:46:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-07 10:46:53,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:53,429 INFO L410 BasicCegarLoop]: trace histogram [1] [2019-12-07 10:46:53,429 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:53,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:53,433 INFO L82 PathProgramCache]: Analyzing trace with hash 555, now seen corresponding path program 1 times [2019-12-07 10:46:53,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:53,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667707710] [2019-12-07 10:46:53,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:53,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667707710] [2019-12-07 10:46:53,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:53,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-07 10:46:53,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836721321] [2019-12-07 10:46:53,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 10:46:53,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:53,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 10:46:53,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:46:53,580 INFO L87 Difference]: Start difference. First operand 462 states. Second operand 2 states. [2019-12-07 10:46:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:53,602 INFO L93 Difference]: Finished difference Result 460 states and 1126 transitions. [2019-12-07 10:46:53,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:46:53,603 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-07 10:46:53,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:53,613 INFO L225 Difference]: With dead ends: 460 [2019-12-07 10:46:53,613 INFO L226 Difference]: Without dead ends: 385 [2019-12-07 10:46:53,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:46:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-07 10:46:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2019-12-07 10:46:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-12-07 10:46:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2019-12-07 10:46:53,661 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2019-12-07 10:46:53,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:53,661 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2019-12-07 10:46:53,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 10:46:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2019-12-07 10:46:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 10:46:53,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:53,662 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 10:46:53,662 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:53,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:53,662 INFO L82 PathProgramCache]: Analyzing trace with hash 17095183, now seen corresponding path program 1 times [2019-12-07 10:46:53,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:53,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570683933] [2019-12-07 10:46:53,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:53,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570683933] [2019-12-07 10:46:53,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:53,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:46:53,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318866903] [2019-12-07 10:46:53,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:46:53,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:53,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:46:53,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:46:53,763 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2019-12-07 10:46:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:53,848 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2019-12-07 10:46:53,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:46:53,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 10:46:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:53,854 INFO L225 Difference]: With dead ends: 540 [2019-12-07 10:46:53,854 INFO L226 Difference]: Without dead ends: 540 [2019-12-07 10:46:53,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:46:53,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-12-07 10:46:53,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2019-12-07 10:46:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-12-07 10:46:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2019-12-07 10:46:53,879 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2019-12-07 10:46:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:53,879 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2019-12-07 10:46:53,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:46:53,879 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2019-12-07 10:46:53,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 10:46:53,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:53,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 10:46:53,880 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:53,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:53,880 INFO L82 PathProgramCache]: Analyzing trace with hash -751398463, now seen corresponding path program 1 times [2019-12-07 10:46:53,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:53,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202027380] [2019-12-07 10:46:53,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:53,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202027380] [2019-12-07 10:46:53,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:53,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:46:53,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678386076] [2019-12-07 10:46:53,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:46:53,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:53,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:46:53,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:46:53,932 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 4 states. [2019-12-07 10:46:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:54,067 INFO L93 Difference]: Finished difference Result 599 states and 1429 transitions. [2019-12-07 10:46:54,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:46:54,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 10:46:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:54,071 INFO L225 Difference]: With dead ends: 599 [2019-12-07 10:46:54,071 INFO L226 Difference]: Without dead ends: 514 [2019-12-07 10:46:54,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:46:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-07 10:46:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2019-12-07 10:46:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-07 10:46:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2019-12-07 10:46:54,082 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2019-12-07 10:46:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:54,082 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2019-12-07 10:46:54,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:46:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2019-12-07 10:46:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 10:46:54,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:54,084 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:54,084 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1452138275, now seen corresponding path program 1 times [2019-12-07 10:46:54,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:54,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172355643] [2019-12-07 10:46:54,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:54,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172355643] [2019-12-07 10:46:54,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:54,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:46:54,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902158573] [2019-12-07 10:46:54,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:46:54,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:54,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:46:54,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:46:54,122 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2019-12-07 10:46:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:54,135 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2019-12-07 10:46:54,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:46:54,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 10:46:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:54,137 INFO L225 Difference]: With dead ends: 162 [2019-12-07 10:46:54,137 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 10:46:54,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:46:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 10:46:54,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-12-07 10:46:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-07 10:46:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2019-12-07 10:46:54,140 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2019-12-07 10:46:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:54,140 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2019-12-07 10:46:54,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:46:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2019-12-07 10:46:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:46:54,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:54,142 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:54,142 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:54,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:54,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2124244464, now seen corresponding path program 1 times [2019-12-07 10:46:54,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:54,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208559865] [2019-12-07 10:46:54,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:54,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208559865] [2019-12-07 10:46:54,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:54,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:46:54,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789929145] [2019-12-07 10:46:54,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:46:54,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:54,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:46:54,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:46:54,296 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 6 states. [2019-12-07 10:46:54,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:54,435 INFO L93 Difference]: Finished difference Result 186 states and 379 transitions. [2019-12-07 10:46:54,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:46:54,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:46:54,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:54,437 INFO L225 Difference]: With dead ends: 186 [2019-12-07 10:46:54,437 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 10:46:54,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:46:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 10:46:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2019-12-07 10:46:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-07 10:46:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 335 transitions. [2019-12-07 10:46:54,442 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 335 transitions. Word has length 22 [2019-12-07 10:46:54,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:54,442 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 335 transitions. [2019-12-07 10:46:54,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:46:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 335 transitions. [2019-12-07 10:46:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:46:54,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:54,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:54,445 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:54,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:54,445 INFO L82 PathProgramCache]: Analyzing trace with hash 732163342, now seen corresponding path program 1 times [2019-12-07 10:46:54,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:54,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203378423] [2019-12-07 10:46:54,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:54,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203378423] [2019-12-07 10:46:54,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:54,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:46:54,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287871307] [2019-12-07 10:46:54,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:46:54,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:54,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:46:54,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:46:54,562 INFO L87 Difference]: Start difference. First operand 162 states and 335 transitions. Second operand 5 states. [2019-12-07 10:46:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:54,742 INFO L93 Difference]: Finished difference Result 206 states and 412 transitions. [2019-12-07 10:46:54,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:46:54,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 10:46:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:54,743 INFO L225 Difference]: With dead ends: 206 [2019-12-07 10:46:54,744 INFO L226 Difference]: Without dead ends: 206 [2019-12-07 10:46:54,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:46:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-07 10:46:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2019-12-07 10:46:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-12-07 10:46:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 390 transitions. [2019-12-07 10:46:54,747 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 390 transitions. Word has length 22 [2019-12-07 10:46:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:54,748 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 390 transitions. [2019-12-07 10:46:54,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:46:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 390 transitions. [2019-12-07 10:46:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:46:54,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:54,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:54,749 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:54,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash -55183662, now seen corresponding path program 2 times [2019-12-07 10:46:54,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:54,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068339421] [2019-12-07 10:46:54,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:55,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068339421] [2019-12-07 10:46:55,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:55,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:46:55,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264660460] [2019-12-07 10:46:55,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:46:55,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:55,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:46:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:46:55,893 INFO L87 Difference]: Start difference. First operand 194 states and 390 transitions. Second operand 16 states. [2019-12-07 10:46:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:57,674 INFO L93 Difference]: Finished difference Result 301 states and 558 transitions. [2019-12-07 10:46:57,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:46:57,674 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:46:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:57,676 INFO L225 Difference]: With dead ends: 301 [2019-12-07 10:46:57,676 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 10:46:57,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:46:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 10:46:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 235. [2019-12-07 10:46:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 10:46:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 447 transitions. [2019-12-07 10:46:57,684 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 447 transitions. Word has length 22 [2019-12-07 10:46:57,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:57,684 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 447 transitions. [2019-12-07 10:46:57,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:46:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 447 transitions. [2019-12-07 10:46:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:46:57,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:57,685 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:57,685 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:57,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:57,686 INFO L82 PathProgramCache]: Analyzing trace with hash -55183677, now seen corresponding path program 1 times [2019-12-07 10:46:57,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:57,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658215005] [2019-12-07 10:46:57,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:58,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658215005] [2019-12-07 10:46:58,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:58,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:46:58,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249879236] [2019-12-07 10:46:58,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:46:58,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:58,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:46:58,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:46:58,115 INFO L87 Difference]: Start difference. First operand 235 states and 447 transitions. Second operand 9 states. [2019-12-07 10:46:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:58,564 INFO L93 Difference]: Finished difference Result 321 states and 587 transitions. [2019-12-07 10:46:58,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:46:58,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-07 10:46:58,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:58,566 INFO L225 Difference]: With dead ends: 321 [2019-12-07 10:46:58,566 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 10:46:58,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:46:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 10:46:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 235. [2019-12-07 10:46:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 10:46:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 453 transitions. [2019-12-07 10:46:58,573 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 453 transitions. Word has length 22 [2019-12-07 10:46:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:58,573 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 453 transitions. [2019-12-07 10:46:58,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:46:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 453 transitions. [2019-12-07 10:46:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:46:58,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:58,574 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:58,574 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:58,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:58,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1284449614, now seen corresponding path program 2 times [2019-12-07 10:46:58,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:58,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739086471] [2019-12-07 10:46:58,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:46:58,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739086471] [2019-12-07 10:46:58,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:58,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:46:58,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900553804] [2019-12-07 10:46:58,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:46:58,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:58,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:46:58,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:46:58,724 INFO L87 Difference]: Start difference. First operand 235 states and 453 transitions. Second operand 6 states. [2019-12-07 10:46:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:59,104 INFO L93 Difference]: Finished difference Result 242 states and 463 transitions. [2019-12-07 10:46:59,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:46:59,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:46:59,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:59,106 INFO L225 Difference]: With dead ends: 242 [2019-12-07 10:46:59,106 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 10:46:59,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:46:59,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 10:46:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2019-12-07 10:46:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-12-07 10:46:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 398 transitions. [2019-12-07 10:46:59,110 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 398 transitions. Word has length 22 [2019-12-07 10:46:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:46:59,110 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 398 transitions. [2019-12-07 10:46:59,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:46:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 398 transitions. [2019-12-07 10:46:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:46:59,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:59,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:46:59,111 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:59,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:59,111 INFO L82 PathProgramCache]: Analyzing trace with hash 497102610, now seen corresponding path program 3 times [2019-12-07 10:46:59,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:59,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057816175] [2019-12-07 10:46:59,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:00,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057816175] [2019-12-07 10:47:00,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:00,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:00,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750607132] [2019-12-07 10:47:00,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:00,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:00,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:00,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:00,238 INFO L87 Difference]: Start difference. First operand 202 states and 398 transitions. Second operand 16 states. [2019-12-07 10:47:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:02,121 INFO L93 Difference]: Finished difference Result 308 states and 587 transitions. [2019-12-07 10:47:02,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:47:02,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:02,124 INFO L225 Difference]: With dead ends: 308 [2019-12-07 10:47:02,124 INFO L226 Difference]: Without dead ends: 295 [2019-12-07 10:47:02,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:47:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-07 10:47:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 202. [2019-12-07 10:47:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-12-07 10:47:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 397 transitions. [2019-12-07 10:47:02,130 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 397 transitions. Word has length 22 [2019-12-07 10:47:02,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:02,130 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 397 transitions. [2019-12-07 10:47:02,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 397 transitions. [2019-12-07 10:47:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:02,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:02,132 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:02,132 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:02,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:02,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2050812348, now seen corresponding path program 3 times [2019-12-07 10:47:02,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:02,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571083518] [2019-12-07 10:47:02,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:02,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571083518] [2019-12-07 10:47:02,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:02,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 10:47:02,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040827282] [2019-12-07 10:47:02,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:47:02,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:02,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:47:02,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:47:02,487 INFO L87 Difference]: Start difference. First operand 202 states and 397 transitions. Second operand 12 states. [2019-12-07 10:47:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:04,156 INFO L93 Difference]: Finished difference Result 423 states and 837 transitions. [2019-12-07 10:47:04,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:47:04,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-12-07 10:47:04,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:04,159 INFO L225 Difference]: With dead ends: 423 [2019-12-07 10:47:04,159 INFO L226 Difference]: Without dead ends: 401 [2019-12-07 10:47:04,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=222, Invalid=480, Unknown=0, NotChecked=0, Total=702 [2019-12-07 10:47:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-12-07 10:47:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 265. [2019-12-07 10:47:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 10:47:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 560 transitions. [2019-12-07 10:47:04,163 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 560 transitions. Word has length 22 [2019-12-07 10:47:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:04,164 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 560 transitions. [2019-12-07 10:47:04,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:47:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 560 transitions. [2019-12-07 10:47:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:04,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:04,164 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:04,164 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1069211444, now seen corresponding path program 4 times [2019-12-07 10:47:04,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:04,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648818452] [2019-12-07 10:47:04,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:05,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648818452] [2019-12-07 10:47:05,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:05,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:05,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282859739] [2019-12-07 10:47:05,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:05,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:05,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:05,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:05,216 INFO L87 Difference]: Start difference. First operand 265 states and 560 transitions. Second operand 16 states. [2019-12-07 10:47:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:06,965 INFO L93 Difference]: Finished difference Result 397 states and 812 transitions. [2019-12-07 10:47:06,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:47:06,966 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:06,968 INFO L225 Difference]: With dead ends: 397 [2019-12-07 10:47:06,968 INFO L226 Difference]: Without dead ends: 397 [2019-12-07 10:47:06,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-12-07 10:47:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 279. [2019-12-07 10:47:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-12-07 10:47:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 580 transitions. [2019-12-07 10:47:06,974 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 580 transitions. Word has length 22 [2019-12-07 10:47:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:06,975 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 580 transitions. [2019-12-07 10:47:06,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 580 transitions. [2019-12-07 10:47:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:06,976 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:06,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:06,976 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:06,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:06,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1069211429, now seen corresponding path program 2 times [2019-12-07 10:47:06,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:06,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297561013] [2019-12-07 10:47:06,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:07,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297561013] [2019-12-07 10:47:07,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:07,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:47:07,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407953471] [2019-12-07 10:47:07,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:47:07,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:07,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:47:07,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:47:07,358 INFO L87 Difference]: Start difference. First operand 279 states and 580 transitions. Second operand 9 states. [2019-12-07 10:47:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:07,766 INFO L93 Difference]: Finished difference Result 384 states and 770 transitions. [2019-12-07 10:47:07,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:47:07,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-07 10:47:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:07,768 INFO L225 Difference]: With dead ends: 384 [2019-12-07 10:47:07,769 INFO L226 Difference]: Without dead ends: 376 [2019-12-07 10:47:07,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:47:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-12-07 10:47:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 321. [2019-12-07 10:47:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-07 10:47:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 673 transitions. [2019-12-07 10:47:07,773 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 673 transitions. Word has length 22 [2019-12-07 10:47:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:07,773 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 673 transitions. [2019-12-07 10:47:07,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:47:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 673 transitions. [2019-12-07 10:47:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:07,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:07,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:07,774 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:07,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:07,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1515700702, now seen corresponding path program 5 times [2019-12-07 10:47:07,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:07,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752067803] [2019-12-07 10:47:07,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:08,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752067803] [2019-12-07 10:47:08,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:08,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:08,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668568812] [2019-12-07 10:47:08,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:08,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:08,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:08,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:08,890 INFO L87 Difference]: Start difference. First operand 321 states and 673 transitions. Second operand 16 states. [2019-12-07 10:47:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:10,568 INFO L93 Difference]: Finished difference Result 445 states and 911 transitions. [2019-12-07 10:47:10,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:47:10,568 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:10,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:10,570 INFO L225 Difference]: With dead ends: 445 [2019-12-07 10:47:10,570 INFO L226 Difference]: Without dead ends: 432 [2019-12-07 10:47:10,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-07 10:47:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 319. [2019-12-07 10:47:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-07 10:47:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 668 transitions. [2019-12-07 10:47:10,576 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 668 transitions. Word has length 22 [2019-12-07 10:47:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:10,576 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 668 transitions. [2019-12-07 10:47:10,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 668 transitions. [2019-12-07 10:47:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:10,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:10,577 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:10,577 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:10,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:10,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1027069572, now seen corresponding path program 6 times [2019-12-07 10:47:10,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:10,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931014606] [2019-12-07 10:47:10,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:11,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931014606] [2019-12-07 10:47:11,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:11,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:11,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071118081] [2019-12-07 10:47:11,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:11,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:11,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:11,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:11,651 INFO L87 Difference]: Start difference. First operand 319 states and 668 transitions. Second operand 16 states. [2019-12-07 10:47:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:13,296 INFO L93 Difference]: Finished difference Result 443 states and 903 transitions. [2019-12-07 10:47:13,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:47:13,296 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:13,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:13,298 INFO L225 Difference]: With dead ends: 443 [2019-12-07 10:47:13,298 INFO L226 Difference]: Without dead ends: 432 [2019-12-07 10:47:13,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-07 10:47:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 327. [2019-12-07 10:47:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-07 10:47:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 674 transitions. [2019-12-07 10:47:13,303 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 674 transitions. Word has length 22 [2019-12-07 10:47:13,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:13,304 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 674 transitions. [2019-12-07 10:47:13,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 674 transitions. [2019-12-07 10:47:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:13,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:13,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:13,305 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:13,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:13,305 INFO L82 PathProgramCache]: Analyzing trace with hash 718214449, now seen corresponding path program 3 times [2019-12-07 10:47:13,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:13,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131137533] [2019-12-07 10:47:13,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:13,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131137533] [2019-12-07 10:47:13,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:13,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:47:13,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21795690] [2019-12-07 10:47:13,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:47:13,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:13,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:47:13,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:47:13,665 INFO L87 Difference]: Start difference. First operand 327 states and 674 transitions. Second operand 9 states. [2019-12-07 10:47:14,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:14,085 INFO L93 Difference]: Finished difference Result 405 states and 792 transitions. [2019-12-07 10:47:14,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:47:14,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-07 10:47:14,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:14,088 INFO L225 Difference]: With dead ends: 405 [2019-12-07 10:47:14,088 INFO L226 Difference]: Without dead ends: 393 [2019-12-07 10:47:14,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:47:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-12-07 10:47:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 309. [2019-12-07 10:47:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-07 10:47:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 649 transitions. [2019-12-07 10:47:14,095 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 649 transitions. Word has length 22 [2019-12-07 10:47:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:14,095 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 649 transitions. [2019-12-07 10:47:14,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:47:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 649 transitions. [2019-12-07 10:47:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:14,096 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:14,096 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:14,096 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1341843718, now seen corresponding path program 7 times [2019-12-07 10:47:14,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:14,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954378786] [2019-12-07 10:47:14,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:15,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954378786] [2019-12-07 10:47:15,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:15,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:15,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199376785] [2019-12-07 10:47:15,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:15,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:15,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:15,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:15,233 INFO L87 Difference]: Start difference. First operand 309 states and 649 transitions. Second operand 16 states. [2019-12-07 10:47:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:17,196 INFO L93 Difference]: Finished difference Result 464 states and 936 transitions. [2019-12-07 10:47:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:47:17,197 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:17,199 INFO L225 Difference]: With dead ends: 464 [2019-12-07 10:47:17,200 INFO L226 Difference]: Without dead ends: 442 [2019-12-07 10:47:17,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:47:17,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-12-07 10:47:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 299. [2019-12-07 10:47:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-12-07 10:47:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 632 transitions. [2019-12-07 10:47:17,207 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 632 transitions. Word has length 22 [2019-12-07 10:47:17,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:17,207 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 632 transitions. [2019-12-07 10:47:17,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:17,207 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 632 transitions. [2019-12-07 10:47:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:17,208 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:17,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:17,208 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:17,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1650245952, now seen corresponding path program 8 times [2019-12-07 10:47:17,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:17,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199475625] [2019-12-07 10:47:17,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:17,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199475625] [2019-12-07 10:47:17,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:17,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:47:17,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092400616] [2019-12-07 10:47:17,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:47:17,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:47:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:47:17,309 INFO L87 Difference]: Start difference. First operand 299 states and 632 transitions. Second operand 6 states. [2019-12-07 10:47:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:17,435 INFO L93 Difference]: Finished difference Result 315 states and 656 transitions. [2019-12-07 10:47:17,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:47:17,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:47:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:17,436 INFO L225 Difference]: With dead ends: 315 [2019-12-07 10:47:17,436 INFO L226 Difference]: Without dead ends: 315 [2019-12-07 10:47:17,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:47:17,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-12-07 10:47:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2019-12-07 10:47:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-12-07 10:47:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 652 transitions. [2019-12-07 10:47:17,440 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 652 transitions. Word has length 22 [2019-12-07 10:47:17,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:17,441 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 652 transitions. [2019-12-07 10:47:17,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:47:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 652 transitions. [2019-12-07 10:47:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:17,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:17,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:17,441 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:17,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:17,442 INFO L82 PathProgramCache]: Analyzing trace with hash -936962176, now seen corresponding path program 9 times [2019-12-07 10:47:17,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:17,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141524052] [2019-12-07 10:47:17,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:18,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141524052] [2019-12-07 10:47:18,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:18,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:18,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496201593] [2019-12-07 10:47:18,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:18,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:18,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:18,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:18,642 INFO L87 Difference]: Start difference. First operand 311 states and 652 transitions. Second operand 16 states. [2019-12-07 10:47:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:20,037 INFO L93 Difference]: Finished difference Result 340 states and 695 transitions. [2019-12-07 10:47:20,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:47:20,037 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:20,038 INFO L225 Difference]: With dead ends: 340 [2019-12-07 10:47:20,038 INFO L226 Difference]: Without dead ends: 340 [2019-12-07 10:47:20,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:20,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-07 10:47:20,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 339. [2019-12-07 10:47:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-12-07 10:47:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 695 transitions. [2019-12-07 10:47:20,043 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 695 transitions. Word has length 22 [2019-12-07 10:47:20,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:20,044 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 695 transitions. [2019-12-07 10:47:20,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 695 transitions. [2019-12-07 10:47:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:20,044 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:20,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:20,044 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:20,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:20,045 INFO L82 PathProgramCache]: Analyzing trace with hash -936962191, now seen corresponding path program 4 times [2019-12-07 10:47:20,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:20,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159308367] [2019-12-07 10:47:20,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:20,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159308367] [2019-12-07 10:47:20,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:20,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:47:20,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686386220] [2019-12-07 10:47:20,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:47:20,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:20,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:47:20,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:47:20,598 INFO L87 Difference]: Start difference. First operand 339 states and 695 transitions. Second operand 12 states. [2019-12-07 10:47:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:21,867 INFO L93 Difference]: Finished difference Result 535 states and 1007 transitions. [2019-12-07 10:47:21,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:47:21,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-12-07 10:47:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:21,869 INFO L225 Difference]: With dead ends: 535 [2019-12-07 10:47:21,869 INFO L226 Difference]: Without dead ends: 507 [2019-12-07 10:47:21,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:47:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-12-07 10:47:21,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 337. [2019-12-07 10:47:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-12-07 10:47:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 700 transitions. [2019-12-07 10:47:21,875 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 700 transitions. Word has length 22 [2019-12-07 10:47:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:21,875 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 700 transitions. [2019-12-07 10:47:21,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:47:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 700 transitions. [2019-12-07 10:47:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:21,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:21,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:21,876 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:21,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:21,876 INFO L82 PathProgramCache]: Analyzing trace with hash 590296588, now seen corresponding path program 10 times [2019-12-07 10:47:21,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:21,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535692073] [2019-12-07 10:47:21,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:22,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535692073] [2019-12-07 10:47:22,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:22,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:22,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97030076] [2019-12-07 10:47:22,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:22,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:22,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:22,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:22,991 INFO L87 Difference]: Start difference. First operand 337 states and 700 transitions. Second operand 16 states. [2019-12-07 10:47:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:24,512 INFO L93 Difference]: Finished difference Result 380 states and 773 transitions. [2019-12-07 10:47:24,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:47:24,513 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:24,514 INFO L225 Difference]: With dead ends: 380 [2019-12-07 10:47:24,514 INFO L226 Difference]: Without dead ends: 380 [2019-12-07 10:47:24,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-07 10:47:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 365. [2019-12-07 10:47:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-12-07 10:47:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 746 transitions. [2019-12-07 10:47:24,519 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 746 transitions. Word has length 22 [2019-12-07 10:47:24,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:24,520 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 746 transitions. [2019-12-07 10:47:24,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:24,520 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 746 transitions. [2019-12-07 10:47:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:24,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:24,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:24,521 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:24,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:24,521 INFO L82 PathProgramCache]: Analyzing trace with hash 590296573, now seen corresponding path program 5 times [2019-12-07 10:47:24,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:24,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904898268] [2019-12-07 10:47:24,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:25,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904898268] [2019-12-07 10:47:25,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:25,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:47:25,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660611442] [2019-12-07 10:47:25,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:47:25,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:25,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:47:25,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:47:25,042 INFO L87 Difference]: Start difference. First operand 365 states and 746 transitions. Second operand 12 states. [2019-12-07 10:47:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:26,159 INFO L93 Difference]: Finished difference Result 598 states and 1125 transitions. [2019-12-07 10:47:26,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:47:26,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-12-07 10:47:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:26,162 INFO L225 Difference]: With dead ends: 598 [2019-12-07 10:47:26,162 INFO L226 Difference]: Without dead ends: 576 [2019-12-07 10:47:26,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:47:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-07 10:47:26,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 347. [2019-12-07 10:47:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-07 10:47:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 727 transitions. [2019-12-07 10:47:26,167 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 727 transitions. Word has length 22 [2019-12-07 10:47:26,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:26,167 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 727 transitions. [2019-12-07 10:47:26,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:47:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 727 transitions. [2019-12-07 10:47:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:26,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:26,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:26,168 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1516658228, now seen corresponding path program 11 times [2019-12-07 10:47:26,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:26,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314927646] [2019-12-07 10:47:26,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:27,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314927646] [2019-12-07 10:47:27,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:27,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:27,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453811432] [2019-12-07 10:47:27,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:27,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:27,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:27,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:27,346 INFO L87 Difference]: Start difference. First operand 347 states and 727 transitions. Second operand 16 states. [2019-12-07 10:47:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:28,841 INFO L93 Difference]: Finished difference Result 388 states and 790 transitions. [2019-12-07 10:47:28,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:47:28,841 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:28,843 INFO L225 Difference]: With dead ends: 388 [2019-12-07 10:47:28,843 INFO L226 Difference]: Without dead ends: 374 [2019-12-07 10:47:28,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:47:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-07 10:47:28,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 351. [2019-12-07 10:47:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-12-07 10:47:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 733 transitions. [2019-12-07 10:47:28,847 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 733 transitions. Word has length 22 [2019-12-07 10:47:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:28,848 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 733 transitions. [2019-12-07 10:47:28,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 733 transitions. [2019-12-07 10:47:28,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:28,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:28,848 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:28,848 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:28,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:28,849 INFO L82 PathProgramCache]: Analyzing trace with hash -835410036, now seen corresponding path program 12 times [2019-12-07 10:47:28,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:28,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026989620] [2019-12-07 10:47:28,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:29,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026989620] [2019-12-07 10:47:29,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:29,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:29,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751086485] [2019-12-07 10:47:29,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:29,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:29,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:29,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:29,935 INFO L87 Difference]: Start difference. First operand 351 states and 733 transitions. Second operand 16 states. [2019-12-07 10:47:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:31,540 INFO L93 Difference]: Finished difference Result 380 states and 774 transitions. [2019-12-07 10:47:31,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:47:31,541 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:31,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:31,542 INFO L225 Difference]: With dead ends: 380 [2019-12-07 10:47:31,542 INFO L226 Difference]: Without dead ends: 364 [2019-12-07 10:47:31,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-12-07 10:47:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 343. [2019-12-07 10:47:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-07 10:47:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 719 transitions. [2019-12-07 10:47:31,547 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 719 transitions. Word has length 22 [2019-12-07 10:47:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:31,547 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 719 transitions. [2019-12-07 10:47:31,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 719 transitions. [2019-12-07 10:47:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:31,548 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:31,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:31,548 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:31,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:31,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1201713386, now seen corresponding path program 13 times [2019-12-07 10:47:31,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:31,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464065702] [2019-12-07 10:47:31,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:32,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464065702] [2019-12-07 10:47:32,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:32,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:32,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882813188] [2019-12-07 10:47:32,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:32,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:32,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:32,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:32,709 INFO L87 Difference]: Start difference. First operand 343 states and 719 transitions. Second operand 16 states. [2019-12-07 10:47:34,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:34,247 INFO L93 Difference]: Finished difference Result 378 states and 776 transitions. [2019-12-07 10:47:34,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:47:34,248 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:34,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:34,249 INFO L225 Difference]: With dead ends: 378 [2019-12-07 10:47:34,249 INFO L226 Difference]: Without dead ends: 345 [2019-12-07 10:47:34,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-07 10:47:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 337. [2019-12-07 10:47:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-12-07 10:47:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 708 transitions. [2019-12-07 10:47:34,253 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 708 transitions. Word has length 22 [2019-12-07 10:47:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:34,253 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 708 transitions. [2019-12-07 10:47:34,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 708 transitions. [2019-12-07 10:47:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:34,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:34,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:34,254 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:34,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash 563733022, now seen corresponding path program 14 times [2019-12-07 10:47:34,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:34,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779666765] [2019-12-07 10:47:34,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:35,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779666765] [2019-12-07 10:47:35,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:35,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:35,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503054715] [2019-12-07 10:47:35,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:35,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:35,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:35,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:35,444 INFO L87 Difference]: Start difference. First operand 337 states and 708 transitions. Second operand 16 states. [2019-12-07 10:47:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:36,885 INFO L93 Difference]: Finished difference Result 367 states and 752 transitions. [2019-12-07 10:47:36,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:47:36,885 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:36,887 INFO L225 Difference]: With dead ends: 367 [2019-12-07 10:47:36,887 INFO L226 Difference]: Without dead ends: 333 [2019-12-07 10:47:36,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-07 10:47:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2019-12-07 10:47:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-12-07 10:47:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 700 transitions. [2019-12-07 10:47:36,891 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 700 transitions. Word has length 22 [2019-12-07 10:47:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:36,891 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 700 transitions. [2019-12-07 10:47:36,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 700 transitions. [2019-12-07 10:47:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:36,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:36,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:36,892 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:36,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash -778198608, now seen corresponding path program 15 times [2019-12-07 10:47:36,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:36,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125733736] [2019-12-07 10:47:36,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:37,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125733736] [2019-12-07 10:47:37,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:37,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:37,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221100145] [2019-12-07 10:47:37,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:37,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:37,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:37,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:37,897 INFO L87 Difference]: Start difference. First operand 333 states and 700 transitions. Second operand 16 states. [2019-12-07 10:47:39,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:39,552 INFO L93 Difference]: Finished difference Result 385 states and 778 transitions. [2019-12-07 10:47:39,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:47:39,553 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:39,555 INFO L225 Difference]: With dead ends: 385 [2019-12-07 10:47:39,555 INFO L226 Difference]: Without dead ends: 370 [2019-12-07 10:47:39,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-12-07 10:47:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 328. [2019-12-07 10:47:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-07 10:47:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 694 transitions. [2019-12-07 10:47:39,559 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 694 transitions. Word has length 22 [2019-12-07 10:47:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:39,559 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 694 transitions. [2019-12-07 10:47:39,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 694 transitions. [2019-12-07 10:47:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:39,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:39,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:39,560 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:39,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2127826590, now seen corresponding path program 16 times [2019-12-07 10:47:39,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:39,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440964546] [2019-12-07 10:47:39,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:40,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440964546] [2019-12-07 10:47:40,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:40,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:40,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203858043] [2019-12-07 10:47:40,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:40,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:40,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:40,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:40,761 INFO L87 Difference]: Start difference. First operand 328 states and 694 transitions. Second operand 16 states. [2019-12-07 10:47:41,546 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-07 10:47:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:42,190 INFO L93 Difference]: Finished difference Result 354 states and 734 transitions. [2019-12-07 10:47:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:47:42,191 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:42,192 INFO L225 Difference]: With dead ends: 354 [2019-12-07 10:47:42,193 INFO L226 Difference]: Without dead ends: 321 [2019-12-07 10:47:42,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-07 10:47:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2019-12-07 10:47:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-07 10:47:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 686 transitions. [2019-12-07 10:47:42,198 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 686 transitions. Word has length 22 [2019-12-07 10:47:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:42,198 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 686 transitions. [2019-12-07 10:47:42,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 686 transitions. [2019-12-07 10:47:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:42,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:42,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:42,199 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:42,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:42,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1866831716, now seen corresponding path program 17 times [2019-12-07 10:47:42,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:42,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997039000] [2019-12-07 10:47:42,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:42,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997039000] [2019-12-07 10:47:42,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:42,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:47:42,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829669801] [2019-12-07 10:47:42,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:47:42,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:42,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:47:42,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:47:42,292 INFO L87 Difference]: Start difference. First operand 321 states and 686 transitions. Second operand 6 states. [2019-12-07 10:47:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:42,410 INFO L93 Difference]: Finished difference Result 102 states and 171 transitions. [2019-12-07 10:47:42,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:47:42,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:47:42,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:42,411 INFO L225 Difference]: With dead ends: 102 [2019-12-07 10:47:42,411 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 10:47:42,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:47:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 10:47:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-12-07 10:47:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 10:47:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 171 transitions. [2019-12-07 10:47:42,412 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 171 transitions. Word has length 22 [2019-12-07 10:47:42,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:42,412 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 171 transitions. [2019-12-07 10:47:42,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:47:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 171 transitions. [2019-12-07 10:47:42,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:42,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:42,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:42,413 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:42,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:42,413 INFO L82 PathProgramCache]: Analyzing trace with hash -720376412, now seen corresponding path program 18 times [2019-12-07 10:47:42,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:42,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012324016] [2019-12-07 10:47:42,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:42,880 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-12-07 10:47:43,161 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2019-12-07 10:47:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:43,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012324016] [2019-12-07 10:47:43,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:43,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:43,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393476306] [2019-12-07 10:47:43,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:43,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:43,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:43,903 INFO L87 Difference]: Start difference. First operand 102 states and 171 transitions. Second operand 16 states. [2019-12-07 10:47:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:45,289 INFO L93 Difference]: Finished difference Result 147 states and 240 transitions. [2019-12-07 10:47:45,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:47:45,290 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:45,290 INFO L225 Difference]: With dead ends: 147 [2019-12-07 10:47:45,290 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 10:47:45,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 10:47:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-12-07 10:47:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 10:47:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2019-12-07 10:47:45,292 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 22 [2019-12-07 10:47:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:45,293 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2019-12-07 10:47:45,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2019-12-07 10:47:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:45,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:45,293 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:45,293 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:45,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:45,293 INFO L82 PathProgramCache]: Analyzing trace with hash 806882352, now seen corresponding path program 19 times [2019-12-07 10:47:45,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:45,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016065804] [2019-12-07 10:47:45,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:46,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016065804] [2019-12-07 10:47:46,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:46,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:46,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913940268] [2019-12-07 10:47:46,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:46,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:46,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:46,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:46,415 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand 16 states. [2019-12-07 10:47:47,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:47,750 INFO L93 Difference]: Finished difference Result 177 states and 300 transitions. [2019-12-07 10:47:47,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:47:47,751 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:47,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:47,752 INFO L225 Difference]: With dead ends: 177 [2019-12-07 10:47:47,752 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 10:47:47,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:47,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 10:47:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 122. [2019-12-07 10:47:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 10:47:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 205 transitions. [2019-12-07 10:47:47,754 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 205 transitions. Word has length 22 [2019-12-07 10:47:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:47,754 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 205 transitions. [2019-12-07 10:47:47,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 205 transitions. [2019-12-07 10:47:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:47,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:47,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:47,755 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:47,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:47,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1300072464, now seen corresponding path program 20 times [2019-12-07 10:47:47,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:47,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588924292] [2019-12-07 10:47:47,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:48,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588924292] [2019-12-07 10:47:48,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:48,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:48,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431017345] [2019-12-07 10:47:48,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:48,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:48,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:48,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:48,938 INFO L87 Difference]: Start difference. First operand 122 states and 205 transitions. Second operand 16 states. [2019-12-07 10:47:50,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:50,331 INFO L93 Difference]: Finished difference Result 186 states and 304 transitions. [2019-12-07 10:47:50,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:47:50,331 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:50,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:50,332 INFO L225 Difference]: With dead ends: 186 [2019-12-07 10:47:50,332 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 10:47:50,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:47:50,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 10:47:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 130. [2019-12-07 10:47:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 10:47:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 217 transitions. [2019-12-07 10:47:50,334 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 217 transitions. Word has length 22 [2019-12-07 10:47:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:50,334 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 217 transitions. [2019-12-07 10:47:50,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 217 transitions. [2019-12-07 10:47:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:50,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:50,335 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:50,335 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash -618824272, now seen corresponding path program 21 times [2019-12-07 10:47:50,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:50,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689904235] [2019-12-07 10:47:50,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:51,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689904235] [2019-12-07 10:47:51,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:51,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:51,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661410107] [2019-12-07 10:47:51,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:51,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:51,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:51,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:51,426 INFO L87 Difference]: Start difference. First operand 130 states and 217 transitions. Second operand 16 states. [2019-12-07 10:47:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:52,688 INFO L93 Difference]: Finished difference Result 176 states and 282 transitions. [2019-12-07 10:47:52,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:47:52,689 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:52,690 INFO L225 Difference]: With dead ends: 176 [2019-12-07 10:47:52,690 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 10:47:52,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 10:47:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2019-12-07 10:47:52,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 10:47:52,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 189 transitions. [2019-12-07 10:47:52,692 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 189 transitions. Word has length 22 [2019-12-07 10:47:52,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:52,692 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 189 transitions. [2019-12-07 10:47:52,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:52,692 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 189 transitions. [2019-12-07 10:47:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:52,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:52,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:52,692 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:52,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash -985127622, now seen corresponding path program 22 times [2019-12-07 10:47:52,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:52,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816333281] [2019-12-07 10:47:52,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:53,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816333281] [2019-12-07 10:47:53,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:53,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:53,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861853919] [2019-12-07 10:47:53,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:53,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:53,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:53,945 INFO L87 Difference]: Start difference. First operand 114 states and 189 transitions. Second operand 16 states. [2019-12-07 10:47:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:55,293 INFO L93 Difference]: Finished difference Result 167 states and 274 transitions. [2019-12-07 10:47:55,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:47:55,293 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:55,294 INFO L225 Difference]: With dead ends: 167 [2019-12-07 10:47:55,294 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 10:47:55,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 10:47:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2019-12-07 10:47:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 10:47:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 167 transitions. [2019-12-07 10:47:55,295 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 167 transitions. Word has length 22 [2019-12-07 10:47:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:55,296 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 167 transitions. [2019-12-07 10:47:55,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 167 transitions. [2019-12-07 10:47:55,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:55,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:55,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:55,296 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:55,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:55,296 INFO L82 PathProgramCache]: Analyzing trace with hash 780318786, now seen corresponding path program 23 times [2019-12-07 10:47:55,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:55,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589772534] [2019-12-07 10:47:55,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:56,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589772534] [2019-12-07 10:47:56,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:56,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:56,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098862080] [2019-12-07 10:47:56,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:56,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:56,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:56,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:56,548 INFO L87 Difference]: Start difference. First operand 102 states and 167 transitions. Second operand 16 states. [2019-12-07 10:47:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:57,973 INFO L93 Difference]: Finished difference Result 141 states and 226 transitions. [2019-12-07 10:47:57,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:47:57,974 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:47:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:57,974 INFO L225 Difference]: With dead ends: 141 [2019-12-07 10:47:57,974 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 10:47:57,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:47:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 10:47:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-12-07 10:47:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 10:47:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 148 transitions. [2019-12-07 10:47:57,976 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 148 transitions. Word has length 22 [2019-12-07 10:47:57,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:57,976 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 148 transitions. [2019-12-07 10:47:57,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:47:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 148 transitions. [2019-12-07 10:47:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:57,976 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:57,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:57,976 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:57,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:57,977 INFO L82 PathProgramCache]: Analyzing trace with hash 799080048, now seen corresponding path program 24 times [2019-12-07 10:47:57,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:57,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535209905] [2019-12-07 10:47:57,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:59,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535209905] [2019-12-07 10:47:59,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:59,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:47:59,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012808250] [2019-12-07 10:47:59,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:47:59,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:59,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:47:59,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:59,194 INFO L87 Difference]: Start difference. First operand 91 states and 148 transitions. Second operand 16 states. [2019-12-07 10:48:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:48:00,572 INFO L93 Difference]: Finished difference Result 128 states and 205 transitions. [2019-12-07 10:48:00,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:48:00,572 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:48:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:48:00,573 INFO L225 Difference]: With dead ends: 128 [2019-12-07 10:48:00,573 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 10:48:00,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:48:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 10:48:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-12-07 10:48:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 10:48:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 144 transitions. [2019-12-07 10:48:00,574 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 144 transitions. Word has length 22 [2019-12-07 10:48:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:48:00,574 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 144 transitions. [2019-12-07 10:48:00,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:48:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 144 transitions. [2019-12-07 10:48:00,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:48:00,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:48:00,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:48:00,575 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:48:00,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:48:00,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1968628484, now seen corresponding path program 25 times [2019-12-07 10:48:00,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:48:00,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724543127] [2019-12-07 10:48:00,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:48:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:48:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:48:01,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724543127] [2019-12-07 10:48:01,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:48:01,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:48:01,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787972590] [2019-12-07 10:48:01,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:48:01,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:48:01,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:48:01,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:48:01,655 INFO L87 Difference]: Start difference. First operand 89 states and 144 transitions. Second operand 16 states. [2019-12-07 10:48:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:48:02,964 INFO L93 Difference]: Finished difference Result 158 states and 265 transitions. [2019-12-07 10:48:02,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:48:02,964 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:48:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:48:02,965 INFO L225 Difference]: With dead ends: 158 [2019-12-07 10:48:02,965 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 10:48:02,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:48:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 10:48:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 105. [2019-12-07 10:48:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 10:48:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 172 transitions. [2019-12-07 10:48:02,967 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 172 transitions. Word has length 22 [2019-12-07 10:48:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:48:02,967 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 172 transitions. [2019-12-07 10:48:02,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:48:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 172 transitions. [2019-12-07 10:48:02,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:48:02,967 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:48:02,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:48:02,968 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:48:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:48:02,968 INFO L82 PathProgramCache]: Analyzing trace with hash 219383996, now seen corresponding path program 26 times [2019-12-07 10:48:02,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:48:02,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655267541] [2019-12-07 10:48:02,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:48:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:48:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:48:04,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655267541] [2019-12-07 10:48:04,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:48:04,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:48:04,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938357099] [2019-12-07 10:48:04,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:48:04,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:48:04,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:48:04,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:48:04,147 INFO L87 Difference]: Start difference. First operand 105 states and 172 transitions. Second operand 16 states. [2019-12-07 10:48:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:48:05,472 INFO L93 Difference]: Finished difference Result 167 states and 269 transitions. [2019-12-07 10:48:05,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:48:05,473 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:48:05,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:48:05,474 INFO L225 Difference]: With dead ends: 167 [2019-12-07 10:48:05,474 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 10:48:05,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:48:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 10:48:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 113. [2019-12-07 10:48:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 10:48:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 184 transitions. [2019-12-07 10:48:05,476 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 184 transitions. Word has length 22 [2019-12-07 10:48:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:48:05,476 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 184 transitions. [2019-12-07 10:48:05,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:48:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 184 transitions. [2019-12-07 10:48:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:48:05,476 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:48:05,476 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:48:05,476 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:48:05,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:48:05,477 INFO L82 PathProgramCache]: Analyzing trace with hash 900632188, now seen corresponding path program 27 times [2019-12-07 10:48:05,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:48:05,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046347746] [2019-12-07 10:48:05,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:48:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:48:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:48:06,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046347746] [2019-12-07 10:48:06,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:48:06,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:48:06,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854209826] [2019-12-07 10:48:06,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:48:06,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:48:06,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:48:06,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:48:06,561 INFO L87 Difference]: Start difference. First operand 113 states and 184 transitions. Second operand 16 states. [2019-12-07 10:48:07,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:48:07,803 INFO L93 Difference]: Finished difference Result 157 states and 247 transitions. [2019-12-07 10:48:07,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:48:07,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:48:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:48:07,804 INFO L225 Difference]: With dead ends: 157 [2019-12-07 10:48:07,804 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 10:48:07,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:48:07,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 10:48:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 97. [2019-12-07 10:48:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 10:48:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 156 transitions. [2019-12-07 10:48:07,806 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 156 transitions. Word has length 22 [2019-12-07 10:48:07,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:48:07,807 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 156 transitions. [2019-12-07 10:48:07,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:48:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 156 transitions. [2019-12-07 10:48:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:48:07,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:48:07,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:48:07,807 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:48:07,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:48:07,807 INFO L82 PathProgramCache]: Analyzing trace with hash 534328838, now seen corresponding path program 28 times [2019-12-07 10:48:07,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:48:07,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754302306] [2019-12-07 10:48:07,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:48:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:48:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:48:08,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754302306] [2019-12-07 10:48:08,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:48:08,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:48:08,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974565762] [2019-12-07 10:48:08,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:48:08,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:48:08,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:48:08,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:48:08,972 INFO L87 Difference]: Start difference. First operand 97 states and 156 transitions. Second operand 16 states. [2019-12-07 10:48:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:48:10,206 INFO L93 Difference]: Finished difference Result 134 states and 213 transitions. [2019-12-07 10:48:10,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:48:10,206 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:48:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:48:10,207 INFO L225 Difference]: With dead ends: 134 [2019-12-07 10:48:10,207 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 10:48:10,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:48:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 10:48:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-12-07 10:48:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 10:48:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 136 transitions. [2019-12-07 10:48:10,208 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 136 transitions. Word has length 22 [2019-12-07 10:48:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:48:10,208 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 136 transitions. [2019-12-07 10:48:10,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:48:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 136 transitions. [2019-12-07 10:48:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:48:10,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:48:10,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:48:10,209 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:48:10,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:48:10,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1929190334, now seen corresponding path program 29 times [2019-12-07 10:48:10,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:48:10,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906043550] [2019-12-07 10:48:10,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:48:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:48:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:48:11,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906043550] [2019-12-07 10:48:11,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:48:11,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:48:11,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165943383] [2019-12-07 10:48:11,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:48:11,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:48:11,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:48:11,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:48:11,302 INFO L87 Difference]: Start difference. First operand 85 states and 136 transitions. Second operand 16 states. [2019-12-07 10:48:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:48:12,629 INFO L93 Difference]: Finished difference Result 120 states and 191 transitions. [2019-12-07 10:48:12,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:48:12,629 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:48:12,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:48:12,630 INFO L225 Difference]: With dead ends: 120 [2019-12-07 10:48:12,630 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 10:48:12,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:48:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 10:48:12,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2019-12-07 10:48:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 10:48:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2019-12-07 10:48:12,631 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 22 [2019-12-07 10:48:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:48:12,631 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2019-12-07 10:48:12,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:48:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2019-12-07 10:48:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:48:12,632 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:48:12,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:48:12,632 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:48:12,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:48:12,632 INFO L82 PathProgramCache]: Analyzing trace with hash -177764482, now seen corresponding path program 30 times [2019-12-07 10:48:12,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:48:12,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713909986] [2019-12-07 10:48:12,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:48:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:48:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:48:13,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713909986] [2019-12-07 10:48:13,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:48:13,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:48:13,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16008734] [2019-12-07 10:48:13,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:48:13,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:48:13,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:48:13,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:48:13,817 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand 16 states. [2019-12-07 10:48:15,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:48:15,278 INFO L93 Difference]: Finished difference Result 114 states and 172 transitions. [2019-12-07 10:48:15,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:48:15,279 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:48:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:48:15,279 INFO L225 Difference]: With dead ends: 114 [2019-12-07 10:48:15,280 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 10:48:15,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:48:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 10:48:15,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2019-12-07 10:48:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 10:48:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 128 transitions. [2019-12-07 10:48:15,282 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 128 transitions. Word has length 22 [2019-12-07 10:48:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:48:15,282 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 128 transitions. [2019-12-07 10:48:15,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:48:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 128 transitions. [2019-12-07 10:48:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:48:15,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:48:15,283 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:48:15,283 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:48:15,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:48:15,283 INFO L82 PathProgramCache]: Analyzing trace with hash 503483710, now seen corresponding path program 31 times [2019-12-07 10:48:15,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:48:15,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795209690] [2019-12-07 10:48:15,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:48:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:48:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:48:16,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795209690] [2019-12-07 10:48:16,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:48:16,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:48:16,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871297101] [2019-12-07 10:48:16,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:48:16,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:48:16,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:48:16,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:48:16,367 INFO L87 Difference]: Start difference. First operand 85 states and 128 transitions. Second operand 16 states. [2019-12-07 10:48:17,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:48:17,572 INFO L93 Difference]: Finished difference Result 104 states and 150 transitions. [2019-12-07 10:48:17,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:48:17,573 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:48:17,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:48:17,573 INFO L225 Difference]: With dead ends: 104 [2019-12-07 10:48:17,573 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 10:48:17,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:48:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 10:48:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2019-12-07 10:48:17,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 10:48:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2019-12-07 10:48:17,575 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 22 [2019-12-07 10:48:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:48:17,575 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2019-12-07 10:48:17,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:48:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2019-12-07 10:48:17,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:48:17,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:48:17,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:48:17,575 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:48:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:48:17,576 INFO L82 PathProgramCache]: Analyzing trace with hash -3039712, now seen corresponding path program 32 times [2019-12-07 10:48:17,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:48:17,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786218783] [2019-12-07 10:48:17,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:48:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:48:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:48:18,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786218783] [2019-12-07 10:48:18,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:48:18,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:48:18,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315082544] [2019-12-07 10:48:18,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:48:18,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:48:18,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:48:18,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:48:18,785 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand 16 states. [2019-12-07 10:48:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:48:19,923 INFO L93 Difference]: Finished difference Result 64 states and 95 transitions. [2019-12-07 10:48:19,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:48:19,923 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:48:19,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:48:19,924 INFO L225 Difference]: With dead ends: 64 [2019-12-07 10:48:19,924 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:48:19,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:48:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:48:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:48:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:48:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:48:19,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-12-07 10:48:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:48:19,924 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:48:19,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:48:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:48:19,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:48:19,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:48:19 BasicIcfg [2019-12-07 10:48:19,927 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:48:19,927 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:48:19,927 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:48:19,927 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:48:19,928 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:45:56" (3/4) ... [2019-12-07 10:48:19,931 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:48:19,936 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2019-12-07 10:48:19,940 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 10:48:19,940 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 10:48:19,940 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 10:48:19,978 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7668585b-3e9c-49a6-84fe-4f247073a786/bin/uautomizer/witness.graphml [2019-12-07 10:48:19,978 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:48:19,979 INFO L168 Benchmark]: Toolchain (without parser) took 144835.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 934.4 MB in the beginning and 871.3 MB in the end (delta: 63.1 MB). Peak memory consumption was 194.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:48:19,979 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:48:19,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 934.4 MB in the beginning and 960.3 MB in the end (delta: -25.9 MB). Peak memory consumption was 88.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:48:19,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.02 ms. Allocated memory is still 1.1 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:48:19,980 INFO L168 Benchmark]: Boogie Preprocessor took 32.19 ms. Allocated memory is still 1.1 GB. Free memory was 960.3 MB in the beginning and 955.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:48:19,980 INFO L168 Benchmark]: RCFGBuilder took 481.94 ms. Allocated memory is still 1.1 GB. Free memory was 955.0 MB in the beginning and 906.2 MB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:48:19,981 INFO L168 Benchmark]: TraceAbstraction took 143461.23 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 29.4 MB). Free memory was 906.2 MB in the beginning and 879.9 MB in the end (delta: 26.3 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:48:19,981 INFO L168 Benchmark]: Witness Printer took 50.82 ms. Allocated memory is still 1.2 GB. Free memory was 879.9 MB in the beginning and 871.3 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:48:19,983 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 757.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 934.4 MB in the beginning and 960.3 MB in the end (delta: -25.9 MB). Peak memory consumption was 88.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.02 ms. Allocated memory is still 1.1 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.19 ms. Allocated memory is still 1.1 GB. Free memory was 960.3 MB in the beginning and 955.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 481.94 ms. Allocated memory is still 1.1 GB. Free memory was 955.0 MB in the beginning and 906.2 MB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 143461.23 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 29.4 MB). Free memory was 906.2 MB in the beginning and 879.9 MB in the end (delta: 26.3 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. * Witness Printer took 50.82 ms. Allocated memory is still 1.2 GB. Free memory was 879.9 MB in the beginning and 871.3 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 56.8s, 151 ProgramPointsBefore, 41 ProgramPointsAfterwards, 155 TransitionsBefore, 41 TransitionsAfterwards, 2884 CoEnabledTransitionPairs, 8 FixpointIterations, 86 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 16 ConcurrentYvCompositions, 5 ChoiceCompositions, 1460 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 8 SemBasedMoverChecksPositive, 33 SemBasedMoverChecksNegative, 22 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 47.8s, 0 MoverChecksTotal, 5217 CheckedPairsTotal, 160 TotalNumberOfCompositions - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Result: SAFE, OverallTime: 143.3s, OverallIterations: 44, TraceHistogramMax: 1, AutomataDifference: 49.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1022 SDtfs, 2344 SDslu, 5132 SDs, 0 SdLazy, 15150 SolverSat, 1056 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 865 GetRequests, 28 SyntacticMatches, 86 SemanticMatches, 751 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1793 ImplicationChecksByTransitivity, 54.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 44 MinimizatonAttempts, 1895 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 35.9s InterpolantComputationTime, 901 NumberOfCodeBlocks, 901 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 857 ConstructedInterpolants, 0 QuantifiedInterpolants, 402241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...