./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b88a605df784da4b84aa984e355b57373efff76 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b88a605df784da4b84aa984e355b57373efff76 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_44 term size 60 --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:01:37,949 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:01:37,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:01:37,960 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:01:37,960 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:01:37,961 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:01:37,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:01:37,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:01:37,964 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:01:37,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:01:37,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:01:37,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:01:37,967 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:01:37,968 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:01:37,969 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:01:37,969 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:01:37,970 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:01:37,971 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:01:37,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:01:37,974 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:01:37,975 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:01:37,976 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:01:37,978 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:01:37,978 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:01:37,978 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:01:37,979 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:01:37,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:01:37,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:01:37,981 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:01:37,982 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:01:37,982 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:01:37,983 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:01:37,983 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:01:37,983 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:01:37,984 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:01:37,985 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:01:37,985 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 06:01:37,996 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:01:37,996 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:01:37,997 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 06:01:37,997 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 06:01:37,997 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 06:01:37,997 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 06:01:37,997 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 06:01:37,997 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 06:01:37,998 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 06:01:37,998 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 06:01:37,998 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 06:01:37,998 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:01:37,999 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:01:37,999 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:01:37,999 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:01:37,999 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:01:37,999 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 06:01:37,999 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 06:01:38,000 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 06:01:38,000 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:01:38,000 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:01:38,000 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 06:01:38,000 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:01:38,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:01:38,001 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 06:01:38,001 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 06:01:38,001 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:01:38,001 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:01:38,001 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 06:01:38,001 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 06:01:38,002 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 06:01:38,002 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 06:01:38,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 06:01:38,002 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 06:01:38,002 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan 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 -> Taipan 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 -> 8b88a605df784da4b84aa984e355b57373efff76 [2018-11-10 06:01:38,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:01:38,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:01:38,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:01:38,039 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:01:38,039 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:01:38,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:01:38,082 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/data/5808e5368/202a2fc77fc949049b2ae17b7bdba1cd/FLAG49a6ef4c4 [2018-11-10 06:01:38,481 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:01:38,481 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:01:38,490 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/data/5808e5368/202a2fc77fc949049b2ae17b7bdba1cd/FLAG49a6ef4c4 [2018-11-10 06:01:38,504 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/data/5808e5368/202a2fc77fc949049b2ae17b7bdba1cd [2018-11-10 06:01:38,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:01:38,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:01:38,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:01:38,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:01:38,511 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:01:38,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:01:38" (1/1) ... [2018-11-10 06:01:38,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4943cf3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:38, skipping insertion in model container [2018-11-10 06:01:38,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:01:38" (1/1) ... [2018-11-10 06:01:38,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:01:38,553 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:01:38,758 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:01:38,766 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:01:38,802 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:01:38,826 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:01:38,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:38 WrapperNode [2018-11-10 06:01:38,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:01:38,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:01:38,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:01:38,828 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:01:38,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:38" (1/1) ... [2018-11-10 06:01:38,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:38" (1/1) ... [2018-11-10 06:01:38,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:01:38,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:01:38,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:01:38,904 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:01:38,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:38" (1/1) ... [2018-11-10 06:01:38,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:38" (1/1) ... [2018-11-10 06:01:38,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:38" (1/1) ... [2018-11-10 06:01:38,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:38" (1/1) ... [2018-11-10 06:01:38,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:38" (1/1) ... [2018-11-10 06:01:38,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:38" (1/1) ... [2018-11-10 06:01:38,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:38" (1/1) ... [2018-11-10 06:01:38,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:01:38,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:01:38,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:01:38,936 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:01:38,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/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 [2018-11-10 06:01:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 06:01:38,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 06:01:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 06:01:38,979 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 06:01:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:01:38,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:01:39,324 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:01:39,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:01:39 BoogieIcfgContainer [2018-11-10 06:01:39,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:01:39,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 06:01:39,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 06:01:39,328 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 06:01:39,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:01:38" (1/3) ... [2018-11-10 06:01:39,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629f9fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:01:39, skipping insertion in model container [2018-11-10 06:01:39,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:38" (2/3) ... [2018-11-10 06:01:39,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629f9fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:01:39, skipping insertion in model container [2018-11-10 06:01:39,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:01:39" (3/3) ... [2018-11-10 06:01:39,330 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:01:39,337 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 06:01:39,343 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-10 06:01:39,354 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-10 06:01:39,378 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 06:01:39,378 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 06:01:39,378 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 06:01:39,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:01:39,378 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:01:39,379 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 06:01:39,379 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:01:39,379 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 06:01:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-10 06:01:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 06:01:39,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:01:39,398 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:39,401 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:01:39,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:39,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1504952782, now seen corresponding path program 1 times [2018-11-10 06:01:39,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:01:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:39,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:39,451 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:01:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:39,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:39,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:01:39,531 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:01:39,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 06:01:39,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 06:01:39,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 06:01:39,548 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-11-10 06:01:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:39,564 INFO L93 Difference]: Finished difference Result 102 states and 148 transitions. [2018-11-10 06:01:39,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 06:01:39,565 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-10 06:01:39,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:01:39,572 INFO L225 Difference]: With dead ends: 102 [2018-11-10 06:01:39,572 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 06:01:39,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 06:01:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 06:01:39,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-10 06:01:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 06:01:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-10 06:01:39,607 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-11-10 06:01:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:01:39,607 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-10 06:01:39,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 06:01:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-10 06:01:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 06:01:39,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:01:39,608 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:39,608 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:01:39,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:39,608 INFO L82 PathProgramCache]: Analyzing trace with hash -266784320, now seen corresponding path program 1 times [2018-11-10 06:01:39,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:01:39,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:39,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:39,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:39,611 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:01:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:39,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:39,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 06:01:39,702 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:01:39,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:01:39,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:01:39,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:01:39,704 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 4 states. [2018-11-10 06:01:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:39,788 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-10 06:01:39,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:01:39,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-10 06:01:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:01:39,790 INFO L225 Difference]: With dead ends: 48 [2018-11-10 06:01:39,790 INFO L226 Difference]: Without dead ends: 46 [2018-11-10 06:01:39,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:01:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-10 06:01:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-10 06:01:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 06:01:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-10 06:01:39,796 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 12 [2018-11-10 06:01:39,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:01:39,797 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-10 06:01:39,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:01:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-10 06:01:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 06:01:39,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:01:39,797 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:39,798 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:01:39,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:39,798 INFO L82 PathProgramCache]: Analyzing trace with hash 318390392, now seen corresponding path program 1 times [2018-11-10 06:01:39,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:01:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:39,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:39,800 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:01:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:39,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:39,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 06:01:39,874 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:01:39,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:01:39,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:01:39,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:01:39,875 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 4 states. [2018-11-10 06:01:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:39,937 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-10 06:01:39,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:01:39,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-10 06:01:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:01:39,939 INFO L225 Difference]: With dead ends: 75 [2018-11-10 06:01:39,939 INFO L226 Difference]: Without dead ends: 73 [2018-11-10 06:01:39,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:01:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-10 06:01:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-11-10 06:01:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 06:01:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-10 06:01:39,946 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 13 [2018-11-10 06:01:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:01:39,946 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-10 06:01:39,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:01:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-10 06:01:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 06:01:39,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:01:39,947 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:39,947 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:01:39,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:39,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1262223739, now seen corresponding path program 1 times [2018-11-10 06:01:39,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:01:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:39,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:39,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:01:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:40,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:40,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:01:40,067 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:01:40,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:01:40,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:01:40,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:01:40,068 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 5 states. [2018-11-10 06:01:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:40,204 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-10 06:01:40,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:01:40,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-10 06:01:40,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:01:40,205 INFO L225 Difference]: With dead ends: 66 [2018-11-10 06:01:40,205 INFO L226 Difference]: Without dead ends: 64 [2018-11-10 06:01:40,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 06:01:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-10 06:01:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-11-10 06:01:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 06:01:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-10 06:01:40,211 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 19 [2018-11-10 06:01:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:01:40,211 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-10 06:01:40,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:01:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-10 06:01:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 06:01:40,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:01:40,212 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:40,216 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:01:40,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:40,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1262260482, now seen corresponding path program 1 times [2018-11-10 06:01:40,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:01:40,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:40,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:40,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:40,219 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:01:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:40,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:40,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:01:40,368 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:01:40,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:01:40,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:01:40,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:01:40,369 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2018-11-10 06:01:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:40,503 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-10 06:01:40,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:01:40,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-10 06:01:40,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:01:40,505 INFO L225 Difference]: With dead ends: 86 [2018-11-10 06:01:40,505 INFO L226 Difference]: Without dead ends: 58 [2018-11-10 06:01:40,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 06:01:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-10 06:01:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-10 06:01:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 06:01:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-10 06:01:40,510 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 19 [2018-11-10 06:01:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:01:40,511 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-10 06:01:40,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:01:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-10 06:01:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 06:01:40,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:01:40,512 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:40,512 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:01:40,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:40,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1770286947, now seen corresponding path program 1 times [2018-11-10 06:01:40,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:01:40,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:40,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:40,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:40,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:01:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:40,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:01:40,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 06:01:40,635 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:01:40,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 06:01:40,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 06:01:40,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:01:40,636 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 6 states. [2018-11-10 06:01:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:40,735 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-10 06:01:40,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 06:01:40,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-10 06:01:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:01:40,736 INFO L225 Difference]: With dead ends: 64 [2018-11-10 06:01:40,736 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 06:01:40,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:01:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 06:01:40,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-10 06:01:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 06:01:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-11-10 06:01:40,743 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 23 [2018-11-10 06:01:40,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:01:40,743 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-11-10 06:01:40,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 06:01:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-10 06:01:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 06:01:40,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:01:40,745 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:40,745 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:01:40,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash 813171697, now seen corresponding path program 1 times [2018-11-10 06:01:40,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:01:40,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:40,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:40,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:40,747 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:01:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:40,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:01:40,902 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:01:40,903 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-11-10 06:01:40,904 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [14], [16], [20], [27], [31], [40], [44], [51], [55], [63], [65], [68], [97], [100], [101], [171], [172], [173] [2018-11-10 06:01:40,949 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 06:01:40,949 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 06:01:41,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 06:01:41,781 INFO L272 AbstractInterpreter]: Visited 23 different actions 45 times. Merged at 17 different actions 21 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 64 variables. [2018-11-10 06:01:41,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:41,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 06:01:41,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:01:41,789 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:01:41,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:41,799 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 06:01:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:41,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:01:41,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 06:01:41,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 06:01:41,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:41,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:41,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:41,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 06:01:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 06:01:41,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:01:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 06:01:42,034 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:01:42,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 10 [2018-11-10 06:01:42,034 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:01:42,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:01:42,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:01:42,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 06:01:42,035 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 5 states. [2018-11-10 06:01:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:01:42,102 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-10 06:01:42,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:01:42,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-10 06:01:42,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:01:42,103 INFO L225 Difference]: With dead ends: 60 [2018-11-10 06:01:42,103 INFO L226 Difference]: Without dead ends: 58 [2018-11-10 06:01:42,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 06:01:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-10 06:01:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-10 06:01:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 06:01:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-10 06:01:42,110 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 25 [2018-11-10 06:01:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:01:42,111 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-10 06:01:42,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:01:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-10 06:01:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 06:01:42,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:01:42,112 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:01:42,112 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:01:42,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash 813208440, now seen corresponding path program 1 times [2018-11-10 06:01:42,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:01:42,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:42,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:42,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:01:42,114 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:01:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:42,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:01:42,259 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:01:42,259 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-11-10 06:01:42,259 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [14], [16], [20], [27], [31], [40], [44], [51], [55], [63], [65], [70], [74], [77], [78], [171], [172], [173] [2018-11-10 06:01:42,262 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 06:01:42,262 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 06:01:42,840 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 06:01:42,840 INFO L272 AbstractInterpreter]: Visited 23 different actions 45 times. Merged at 17 different actions 21 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 64 variables. [2018-11-10 06:01:42,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:01:42,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 06:01:42,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:01:42,843 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:01:42,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:01:42,853 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 06:01:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:01:42,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:01:42,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 06:01:42,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:42,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 06:01:42,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 06:01:42,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:42,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:42,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:42,943 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2018-11-10 06:01:42,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:01:42,965 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:01:42,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 06:01:42,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-10 06:01:43,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:01:43,017 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 06:01:43,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:01:43,045 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,060 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,067 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:01:43,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-11-10 06:01:43,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 06:01:43,092 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,097 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:43,111 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:74, output treesize:42 [2018-11-10 06:01:43,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:01:43,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:01:43,155 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:01:43,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-10 06:01:43,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 111 [2018-11-10 06:01:43,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 06:01:43,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 66 [2018-11-10 06:01:43,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-11-10 06:01:43,228 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:43,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-10 06:01:43,239 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,246 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:43,253 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:43,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-11-10 06:01:43,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 06:01:43,277 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-11-10 06:01:43,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:01:43,301 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,323 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,331 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 06:01:43,349 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:183, output treesize:26 [2018-11-10 06:01:43,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-10 06:01:43,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-10 06:01:43,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 06:01:43,384 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,388 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-11-10 06:01:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:01:43,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:01:43,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 683 treesize of output 341 [2018-11-10 06:01:43,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:01:43,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 391 treesize of output 261 [2018-11-10 06:01:43,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 274 [2018-11-10 06:01:43,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:43,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 246 treesize of output 224 [2018-11-10 06:01:43,704 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:43,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 219 treesize of output 199 [2018-11-10 06:01:44,167 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 153 [2018-11-10 06:01:44,173 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:01:44,174 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,176 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:01:44,176 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:01:44,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:44,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 152 [2018-11-10 06:01:44,199 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-10 06:01:44,210 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:01:44,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 109 [2018-11-10 06:01:44,226 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-11-10 06:01:44,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:01:44,232 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:44,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 112 [2018-11-10 06:01:44,246 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-11-10 06:01:44,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 143 [2018-11-10 06:01:44,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:01:44,763 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,784 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 143 [2018-11-10 06:01:44,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:01:44,795 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,818 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 183 [2018-11-10 06:01:44,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:01:44,830 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,857 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,861 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:44,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 140 [2018-11-10 06:01:44,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:01:44,869 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:44,892 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,187 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 120 [2018-11-10 06:01:45,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:01:45,193 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,215 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,215 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-10 06:01:45,216 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,230 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 119 [2018-11-10 06:01:45,239 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,239 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-10 06:01:45,240 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-11-10 06:01:45,259 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,271 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 119 [2018-11-10 06:01:45,290 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,290 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-10 06:01:45,291 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-11-10 06:01:45,314 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,326 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 82 [2018-11-10 06:01:45,543 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2018-11-10 06:01:45,546 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2018-11-10 06:01:45,549 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2018-11-10 06:01:45,553 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2018-11-10 06:01:45,713 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,713 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-11-10 06:01:45,714 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,723 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2018-11-10 06:01:45,729 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,730 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-11-10 06:01:45,731 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,740 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 74 [2018-11-10 06:01:45,747 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,754 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,754 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:45,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2018-11-10 06:01:45,755 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,765 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-11-10 06:01:45,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-11-10 06:01:45,772 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:45,782 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:46,022 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:01:46,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 215 treesize of output 197 [2018-11-10 06:01:46,383 WARN L179 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 147 [2018-11-10 06:01:46,391 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:46,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 139 [2018-11-10 06:01:46,401 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:46,405 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:46,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 99 [2018-11-10 06:01:46,415 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:46,420 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:46,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 99 [2018-11-10 06:01:46,430 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:46,435 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:01:46,435 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:46,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2018-11-10 06:01:46,843 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:46,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 82 [2018-11-10 06:01:46,847 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-11-10 06:01:47,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-11-10 06:01:47,111 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,120 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2018-11-10 06:01:47,126 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:47,126 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:47,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-11-10 06:01:47,127 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,136 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,355 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:47,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 136 [2018-11-10 06:01:47,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:01:47,362 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,399 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 148 [2018-11-10 06:01:47,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 129 [2018-11-10 06:01:47,417 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,446 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 148 [2018-11-10 06:01:47,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 129 [2018-11-10 06:01:47,462 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,491 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 138 [2018-11-10 06:01:47,679 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 138 [2018-11-10 06:01:47,687 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,690 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:47,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 142 [2018-11-10 06:01:47,693 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 123 [2018-11-10 06:01:47,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 101 [2018-11-10 06:01:47,864 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,911 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:47,912 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:47,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 101 [2018-11-10 06:01:47,913 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:47,946 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:01:47,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 123 [2018-11-10 06:01:47,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 101 [2018-11-10 06:01:47,966 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:48,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 106 [2018-11-10 06:01:48,012 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 2 xjuncts. [2018-11-10 06:01:48,052 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:01:48,055 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:01:48,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 123 [2018-11-10 06:01:48,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:01:48,061 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-10 06:01:48,077 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:01:48,215 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:01:48,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 274 treesize of output 238 [2018-11-10 06:01:48,522 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 06:02:03,889 WARN L179 SmtUtils]: Spent 15.34 s on a formula simplification. DAG size of input: 977 DAG size of output: 783 [2018-11-10 06:02:03,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 137 [2018-11-10 06:02:03,917 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:03,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 46 [2018-11-10 06:02:03,929 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 4 xjuncts. [2018-11-10 06:02:03,992 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:02:03,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 97 [2018-11-10 06:02:04,003 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:04,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 46 [2018-11-10 06:02:04,015 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 4 xjuncts. [2018-11-10 06:02:04,080 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:02:04,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 97 [2018-11-10 06:02:04,092 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:04,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 46 [2018-11-10 06:02:04,105 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 4 xjuncts. [2018-11-10 06:02:04,160 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:02:04,162 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:02:04,162 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:15,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-11-10 06:02:15,661 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:02:15,661 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_68 term size 27 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 06:02:15,664 INFO L168 Benchmark]: Toolchain (without parser) took 37157.58 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 657.5 MB). Free memory was 952.2 MB in the beginning and 1.4 GB in the end (delta: -497.6 MB). Peak memory consumption was 738.2 MB. Max. memory is 11.5 GB. [2018-11-10 06:02:15,665 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:02:15,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 928.0 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-10 06:02:15,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 928.0 MB in the beginning and 1.2 GB in the end (delta: -237.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 06:02:15,665 INFO L168 Benchmark]: Boogie Preprocessor took 31.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:02:15,666 INFO L168 Benchmark]: RCFGBuilder took 389.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:02:15,666 INFO L168 Benchmark]: TraceAbstraction took 36338.54 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 486.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -325.1 MB). Peak memory consumption was 739.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:02:15,667 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 928.0 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 928.0 MB in the beginning and 1.2 GB in the end (delta: -237.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 389.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36338.54 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 486.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -325.1 MB). Peak memory consumption was 739.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_68 term size 27 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_68 term size 27: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:02:17,130 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:02:17,131 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:02:17,140 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:02:17,140 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:02:17,141 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:02:17,142 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:02:17,143 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:02:17,144 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:02:17,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:02:17,145 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:02:17,145 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:02:17,146 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:02:17,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:02:17,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:02:17,148 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:02:17,149 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:02:17,150 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:02:17,152 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:02:17,153 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:02:17,154 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:02:17,155 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:02:17,157 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:02:17,157 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:02:17,157 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:02:17,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:02:17,158 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:02:17,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:02:17,160 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:02:17,161 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:02:17,161 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:02:17,161 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:02:17,161 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:02:17,161 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:02:17,162 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:02:17,163 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:02:17,163 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 06:02:17,174 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:02:17,174 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:02:17,174 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 06:02:17,175 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 06:02:17,175 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 06:02:17,175 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 06:02:17,175 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 06:02:17,176 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 06:02:17,176 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:02:17,176 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:02:17,176 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:02:17,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:02:17,177 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 06:02:17,177 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 06:02:17,177 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 06:02:17,177 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 06:02:17,177 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 06:02:17,177 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:02:17,177 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:02:17,177 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 06:02:17,178 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:02:17,178 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:02:17,178 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 06:02:17,178 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 06:02:17,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:02:17,178 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:02:17,178 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 06:02:17,178 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 06:02:17,179 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 06:02:17,179 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 06:02:17,179 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 06:02:17,179 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 06:02:17,179 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan 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 -> Taipan 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 -> 8b88a605df784da4b84aa984e355b57373efff76 [2018-11-10 06:02:17,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:02:17,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:02:17,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:02:17,224 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:02:17,224 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:02:17,225 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:02:17,274 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/data/16e9ae46e/be5f994bcae2456ea3ef66017c5a1197/FLAG6de559b96 [2018-11-10 06:02:17,631 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:02:17,632 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:02:17,638 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/data/16e9ae46e/be5f994bcae2456ea3ef66017c5a1197/FLAG6de559b96 [2018-11-10 06:02:17,647 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/data/16e9ae46e/be5f994bcae2456ea3ef66017c5a1197 [2018-11-10 06:02:17,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:02:17,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:02:17,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:02:17,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:02:17,653 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:02:17,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:02:17" (1/1) ... [2018-11-10 06:02:17,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57bdf600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:17, skipping insertion in model container [2018-11-10 06:02:17,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:02:17" (1/1) ... [2018-11-10 06:02:17,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:02:17,691 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:02:17,892 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:02:17,902 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:02:17,940 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:02:17,968 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:02:17,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:17 WrapperNode [2018-11-10 06:02:17,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:02:17,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:02:17,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:02:17,969 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:02:17,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:17" (1/1) ... [2018-11-10 06:02:17,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:17" (1/1) ... [2018-11-10 06:02:18,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:02:18,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:02:18,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:02:18,052 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:02:18,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:17" (1/1) ... [2018-11-10 06:02:18,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:17" (1/1) ... [2018-11-10 06:02:18,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:17" (1/1) ... [2018-11-10 06:02:18,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:17" (1/1) ... [2018-11-10 06:02:18,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:17" (1/1) ... [2018-11-10 06:02:18,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:17" (1/1) ... [2018-11-10 06:02:18,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:17" (1/1) ... [2018-11-10 06:02:18,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:02:18,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:02:18,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:02:18,074 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:02:18,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/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 [2018-11-10 06:02:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 06:02:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 06:02:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 06:02:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 06:02:18,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:02:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:02:18,485 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:02:18,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:02:18 BoogieIcfgContainer [2018-11-10 06:02:18,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:02:18,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 06:02:18,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 06:02:18,488 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 06:02:18,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:02:17" (1/3) ... [2018-11-10 06:02:18,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722a2086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:02:18, skipping insertion in model container [2018-11-10 06:02:18,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:02:17" (2/3) ... [2018-11-10 06:02:18,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722a2086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:02:18, skipping insertion in model container [2018-11-10 06:02:18,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:02:18" (3/3) ... [2018-11-10 06:02:18,491 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:02:18,497 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 06:02:18,502 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-10 06:02:18,511 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-10 06:02:18,532 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:02:18,532 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 06:02:18,532 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 06:02:18,532 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 06:02:18,532 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:02:18,532 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:02:18,533 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 06:02:18,533 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:02:18,533 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 06:02:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-10 06:02:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 06:02:18,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:02:18,550 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:02:18,552 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:02:18,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:02:18,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1955697552, now seen corresponding path program 1 times [2018-11-10 06:02:18,559 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:02:18,560 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:02:18,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:02:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:02:18,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:02:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:02:18,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 06:02:18,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:02:18,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:02:18,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 06:02:18,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 06:02:18,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 06:02:18,664 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-11-10 06:02:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:02:18,680 INFO L93 Difference]: Finished difference Result 100 states and 146 transitions. [2018-11-10 06:02:18,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 06:02:18,681 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-10 06:02:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:02:18,689 INFO L225 Difference]: With dead ends: 100 [2018-11-10 06:02:18,689 INFO L226 Difference]: Without dead ends: 47 [2018-11-10 06:02:18,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 06:02:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-10 06:02:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-10 06:02:18,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 06:02:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-10 06:02:18,718 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 11 [2018-11-10 06:02:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:02:18,719 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-10 06:02:18,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 06:02:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-10 06:02:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 06:02:18,720 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:02:18,720 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:02:18,720 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:02:18,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:02:18,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1929100148, now seen corresponding path program 1 times [2018-11-10 06:02:18,721 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:02:18,721 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:02:18,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:02:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:02:18,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:02:18,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 06:02:18,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:18,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:18,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 06:02:18,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:02:18,900 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:02:18,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-10 06:02:18,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:18,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:02:18,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:02:18,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:18,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 06:02:18,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 06:02:18,965 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:18,967 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:18,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:18,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:18,980 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:48, output treesize:4 [2018-11-10 06:02:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:02:18,986 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 06:02:18,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:02:18,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 06:02:18,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:02:18,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:02:18,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:02:18,990 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 4 states. [2018-11-10 06:02:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:02:19,131 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-10 06:02:19,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:02:19,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-10 06:02:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:02:19,133 INFO L225 Difference]: With dead ends: 47 [2018-11-10 06:02:19,133 INFO L226 Difference]: Without dead ends: 45 [2018-11-10 06:02:19,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:02:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-10 06:02:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-10 06:02:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 06:02:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-11-10 06:02:19,138 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 11 [2018-11-10 06:02:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:02:19,138 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-10 06:02:19,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:02:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-10 06:02:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 06:02:19,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:02:19,139 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:02:19,139 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:02:19,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:02:19,139 INFO L82 PathProgramCache]: Analyzing trace with hash -328667837, now seen corresponding path program 1 times [2018-11-10 06:02:19,140 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:02:19,140 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:02:19,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:02:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:02:19,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:02:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:02:19,218 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 06:02:19,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:02:19,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 06:02:19,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:02:19,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:02:19,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:02:19,221 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 4 states. [2018-11-10 06:02:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:02:19,378 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-10 06:02:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:02:19,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-10 06:02:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:02:19,380 INFO L225 Difference]: With dead ends: 74 [2018-11-10 06:02:19,381 INFO L226 Difference]: Without dead ends: 72 [2018-11-10 06:02:19,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:02:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-10 06:02:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 43. [2018-11-10 06:02:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 06:02:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-10 06:02:19,387 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 12 [2018-11-10 06:02:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:02:19,388 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-10 06:02:19,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:02:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-10 06:02:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 06:02:19,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:02:19,389 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:02:19,389 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:02:19,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:02:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2059878822, now seen corresponding path program 1 times [2018-11-10 06:02:19,390 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:02:19,390 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:02:19,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:02:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:02:19,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:02:19,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 06:02:19,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 06:02:19,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:19,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:19,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:19,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-10 06:02:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:02:19,499 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 06:02:19,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:02:19,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:02:19,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:02:19,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:02:19,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:02:19,505 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 5 states. [2018-11-10 06:02:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:02:19,675 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-10 06:02:19,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:02:19,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-10 06:02:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:02:19,676 INFO L225 Difference]: With dead ends: 43 [2018-11-10 06:02:19,676 INFO L226 Difference]: Without dead ends: 41 [2018-11-10 06:02:19,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:02:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-10 06:02:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 06:02:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 06:02:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-10 06:02:19,681 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 18 [2018-11-10 06:02:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:02:19,682 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-10 06:02:19,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:02:19,682 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-10 06:02:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 06:02:19,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:02:19,683 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:02:19,684 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:02:19,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:02:19,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2059915565, now seen corresponding path program 1 times [2018-11-10 06:02:19,685 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:02:19,685 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:02:19,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:02:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:02:19,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:02:19,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 06:02:19,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:19,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:19,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-10 06:02:19,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:02:19,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:02:19,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-10 06:02:19,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:19,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 60 [2018-11-10 06:02:19,986 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-10 06:02:19,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:02:19,990 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-10 06:02:20,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-11-10 06:02:20,024 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,029 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-10 06:02:20,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:02:20,063 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 06:02:20,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:02:20,082 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,089 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,095 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,107 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:99, output treesize:11 [2018-11-10 06:02:20,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 06:02:20,128 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:02:20,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-10 06:02:20,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:7 [2018-11-10 06:02:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:02:20,158 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 06:02:20,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:02:20,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:02:20,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:02:20,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:02:20,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:02:20,160 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 5 states. [2018-11-10 06:02:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:02:20,462 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-11-10 06:02:20,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:02:20,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-10 06:02:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:02:20,463 INFO L225 Difference]: With dead ends: 80 [2018-11-10 06:02:20,463 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 06:02:20,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 06:02:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 06:02:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-11-10 06:02:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 06:02:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-10 06:02:20,468 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 18 [2018-11-10 06:02:20,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:02:20,468 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-10 06:02:20,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:02:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-10 06:02:20,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 06:02:20,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:02:20,469 INFO L375 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] [2018-11-10 06:02:20,469 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:02:20,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:02:20,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1674389966, now seen corresponding path program 1 times [2018-11-10 06:02:20,470 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:02:20,470 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:02:20,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:02:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:02:20,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:02:20,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-11-10 06:02:20,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-10 06:02:20,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:21 [2018-11-10 06:02:20,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:02:20,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-10 06:02:20,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 06:02:20,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-10 06:02:20,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-11-10 06:02:20,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 06:02:20,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 06:02:20,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:20,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-10 06:02:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:02:20,677 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 06:02:20,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:02:20,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 06:02:20,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 06:02:20,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 06:02:20,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:02:20,685 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 6 states. [2018-11-10 06:02:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:02:20,986 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-10 06:02:20,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 06:02:20,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-10 06:02:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:02:20,987 INFO L225 Difference]: With dead ends: 60 [2018-11-10 06:02:20,987 INFO L226 Difference]: Without dead ends: 58 [2018-11-10 06:02:20,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:02:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-10 06:02:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-10 06:02:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 06:02:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-10 06:02:20,991 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 22 [2018-11-10 06:02:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:02:20,991 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-10 06:02:20,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 06:02:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-10 06:02:20,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 06:02:20,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:02:20,992 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:02:20,992 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:02:20,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:02:20,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2083477930, now seen corresponding path program 1 times [2018-11-10 06:02:20,993 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:02:20,993 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f84141b-b005-48e2-b356-c0b6d882addb/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:02:21,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:02:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:02:21,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:02:21,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 06:02:21,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 06:02:21,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 06:02:21,167 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,190 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-10 06:02:21,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:02:21,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:02:21,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 06:02:21,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-10 06:02:21,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:02:21,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 06:02:21,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:02:21,415 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,429 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 06:02:21,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 06:02:21,498 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,500 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:02:21,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-11-10 06:02:21,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 06:02:21,546 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,557 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,584 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:81, output treesize:44 [2018-11-10 06:02:21,630 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:02:21,634 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:02:21,638 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:02:21,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-10 06:02:21,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 111 [2018-11-10 06:02:21,821 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-11-10 06:02:21,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 06:02:21,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 66 [2018-11-10 06:02:21,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-11-10 06:02:21,876 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:21,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-11-10 06:02:21,919 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:21,943 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:21,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:22,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-10 06:02:22,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 06:02:22,037 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:22,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-10 06:02:22,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:02:22,071 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:22,085 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:22,096 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:22,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:22,119 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:185, output treesize:24 [2018-11-10 06:02:22,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-10 06:02:22,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-10 06:02:22,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:22,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 06:02:22,174 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:22,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:22,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:02:22,181 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-11-10 06:02:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:02:22,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:02:27,534 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 40 [2018-11-10 06:02:27,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 715 treesize of output 699 [2018-11-10 06:02:27,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 699 treesize of output 683 [2018-11-10 06:02:27,566 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:27,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:02:27,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 683 treesize of output 341 [2018-11-10 06:02:27,954 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-10 06:02:27,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:02:27,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:28,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 391 treesize of output 261 [2018-11-10 06:02:28,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 274 [2018-11-10 06:02:28,333 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:02:30,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 246 treesize of output 224 [2018-11-10 06:02:30,005 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-10 06:02:32,723 INFO L303 Elim1Store]: Index analysis took 363 ms [2018-11-10 06:02:32,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 274 treesize of output 238 [2018-11-10 06:02:32,993 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 06:05:57,954 WARN L179 SmtUtils]: Spent 3.42 m on a formula simplification. DAG size of input: 988 DAG size of output: 810 [2018-11-10 06:05:58,019 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:58,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 156 treesize of output 161 [2018-11-10 06:05:58,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:58,184 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:58,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 160 [2018-11-10 06:05:58,185 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:58,925 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:58,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 130 [2018-11-10 06:05:58,926 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:59,491 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:59,492 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:59,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 145 [2018-11-10 06:05:59,493 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:00,091 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:00,092 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:00,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 152 [2018-11-10 06:06:00,093 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:00,771 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:06:00,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 118 [2018-11-10 06:06:00,897 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:00,897 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:00,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 117 [2018-11-10 06:06:00,899 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:01,422 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:01,423 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:01,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 109 [2018-11-10 06:06:01,424 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:01,916 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:01,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2018-11-10 06:06:01,917 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:02,309 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:02,309 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:02,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 102 [2018-11-10 06:06:02,311 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:02,742 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:06:02,746 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:06:02,746 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:02,786 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:02,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 121 [2018-11-10 06:06:02,849 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:02,849 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:02,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 120 [2018-11-10 06:06:02,850 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:03,410 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:03,411 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:03,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 112 [2018-11-10 06:06:03,412 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:03,889 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:03,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 90 [2018-11-10 06:06:03,890 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:04,386 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:04,386 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:04,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 105 [2018-11-10 06:06:04,388 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:04,848 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:08:31,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 168 [2018-11-10 06:08:31,871 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-10 06:08:31,879 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:08:31,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 161 [2018-11-10 06:08:31,939 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:32,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 168 [2018-11-10 06:08:32,044 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-11-10 06:09:57,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 134 [2018-11-10 06:09:57,139 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:09:57,140 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:09:57,341 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:09:57,342 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_44 term size 60 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 06:09:57,344 INFO L168 Benchmark]: Toolchain (without parser) took 459694.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 944.4 MB in the beginning and 997.2 MB in the end (delta: -52.8 MB). Peak memory consumption was 329.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:09:57,344 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:09:57,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.87 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 922.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 06:09:57,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 922.9 MB in the beginning and 1.1 GB in the end (delta: -226.4 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:09:57,345 INFO L168 Benchmark]: Boogie Preprocessor took 22.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:09:57,345 INFO L168 Benchmark]: RCFGBuilder took 412.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:09:57,345 INFO L168 Benchmark]: TraceAbstraction took 458856.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Free memory was 1.1 GB in the beginning and 997.2 MB in the end (delta: 102.4 MB). Peak memory consumption was 323.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:09:57,347 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.87 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 922.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 922.9 MB in the beginning and 1.1 GB in the end (delta: -226.4 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 412.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 458856.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Free memory was 1.1 GB in the beginning and 997.2 MB in the end (delta: 102.4 MB). Peak memory consumption was 323.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_44 term size 60 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_44 term size 60: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...