java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:25:51,904 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:25:51,905 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:25:51,914 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:25:51,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:25:51,915 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:25:51,916 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:25:51,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:25:51,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:25:51,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:25:51,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:25:51,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:25:51,921 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:25:51,921 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:25:51,922 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:25:51,924 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:25:51,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:25:51,927 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:25:51,928 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:25:51,929 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:25:51,931 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:25:51,931 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:25:51,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:25:51,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:25:51,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:25:51,934 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:25:51,934 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:25:51,935 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:25:51,935 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:25:51,935 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:25:51,935 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:25:51,936 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:25:51,945 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:25:51,945 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:25:51,946 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:25:51,946 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:25:51,946 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:25:51,946 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:25:51,947 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:25:51,947 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:25:51,947 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:25:51,947 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:25:51,947 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:25:51,947 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:25:51,947 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:25:51,947 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:25:51,948 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:25:51,948 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:25:51,948 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:25:51,948 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:25:51,948 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:25:51,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:25:51,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:25:51,949 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:25:51,949 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:25:51,949 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:25:51,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:25:51,985 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:25:51,988 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:25:51,989 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:25:51,989 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:25:51,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i [2018-02-04 12:25:52,160 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:25:52,161 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:25:52,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:25:52,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:25:52,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:25:52,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:25:52" (1/1) ... [2018-02-04 12:25:52,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259b65a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:25:52, skipping insertion in model container [2018-02-04 12:25:52,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:25:52" (1/1) ... [2018-02-04 12:25:52,179 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:25:52,213 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:25:52,317 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:25:52,335 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:25:52,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:25:52 WrapperNode [2018-02-04 12:25:52,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:25:52,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:25:52,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:25:52,343 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:25:52,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:25:52" (1/1) ... [2018-02-04 12:25:52,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:25:52" (1/1) ... [2018-02-04 12:25:52,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:25:52" (1/1) ... [2018-02-04 12:25:52,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:25:52" (1/1) ... [2018-02-04 12:25:52,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:25:52" (1/1) ... [2018-02-04 12:25:52,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:25:52" (1/1) ... [2018-02-04 12:25:52,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:25:52" (1/1) ... [2018-02-04 12:25:52,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:25:52,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:25:52,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:25:52,388 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:25:52,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:25:52" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/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-02-04 12:25:52,429 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:25:52,429 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:25:52,430 INFO L136 BoogieDeclarations]: Found implementation of procedure FFmul [2018-02-04 12:25:52,430 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2018-02-04 12:25:52,430 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2018-02-04 12:25:52,430 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2018-02-04 12:25:52,430 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2018-02-04 12:25:52,430 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2018-02-04 12:25:52,431 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2018-02-04 12:25:52,431 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2018-02-04 12:25:52,431 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:25:52,431 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:25:52,431 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:25:52,431 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 12:25:52,431 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 12:25:52,431 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:25:52,431 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:25:52,431 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:25:52,432 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 12:25:52,432 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 12:25:52,432 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 12:25:52,432 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 12:25:52,432 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 12:25:52,432 INFO L128 BoogieDeclarations]: Found specification of procedure FFmul [2018-02-04 12:25:52,432 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2018-02-04 12:25:52,432 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFnew [2018-02-04 12:25:52,433 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFfree [2018-02-04 12:25:52,433 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFswap [2018-02-04 12:25:52,433 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2018-02-04 12:25:52,433 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2018-02-04 12:25:52,433 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2018-02-04 12:25:52,433 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:25:52,433 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:25:52,433 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:25:52,632 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 12:25:52,891 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:25:52,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:25:52 BoogieIcfgContainer [2018-02-04 12:25:52,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:25:52,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:25:52,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:25:52,895 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:25:52,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:25:52" (1/3) ... [2018-02-04 12:25:52,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3137290f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:25:52, skipping insertion in model container [2018-02-04 12:25:52,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:25:52" (2/3) ... [2018-02-04 12:25:52,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3137290f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:25:52, skipping insertion in model container [2018-02-04 12:25:52,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:25:52" (3/3) ... [2018-02-04 12:25:52,898 INFO L107 eAbstractionObserver]: Analyzing ICFG 20020406-1_false-valid-memtrack.i [2018-02-04 12:25:52,904 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:25:52,910 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-04 12:25:52,935 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:25:52,935 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:25:52,935 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:25:52,935 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:25:52,935 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:25:52,935 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:25:52,935 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:25:52,935 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:25:52,936 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:25:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-02-04 12:25:52,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:25:52,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:52,956 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:52,956 INFO L371 AbstractCegarLoop]: === Iteration 1 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:52,959 INFO L82 PathProgramCache]: Analyzing trace with hash 167141018, now seen corresponding path program 1 times [2018-02-04 12:25:52,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:52,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:52,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:52,992 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:52,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:53,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:53,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:25:53,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:25:53,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:25:53,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:25:53,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:25:53,156 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-02-04 12:25:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:53,373 INFO L93 Difference]: Finished difference Result 205 states and 241 transitions. [2018-02-04 12:25:53,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:25:53,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:25:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:53,385 INFO L225 Difference]: With dead ends: 205 [2018-02-04 12:25:53,385 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 12:25:53,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:25:53,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 12:25:53,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-02-04 12:25:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-04 12:25:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 238 transitions. [2018-02-04 12:25:53,433 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 238 transitions. Word has length 14 [2018-02-04 12:25:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:53,433 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 238 transitions. [2018-02-04 12:25:53,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:25:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 238 transitions. [2018-02-04 12:25:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:25:53,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:53,434 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:53,434 INFO L371 AbstractCegarLoop]: === Iteration 2 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:53,434 INFO L82 PathProgramCache]: Analyzing trace with hash 167141019, now seen corresponding path program 1 times [2018-02-04 12:25:53,435 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:53,435 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:53,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:53,436 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:53,436 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:53,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:53,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:25:53,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:25:53,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:25:53,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:25:53,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:25:53,516 INFO L87 Difference]: Start difference. First operand 202 states and 238 transitions. Second operand 4 states. [2018-02-04 12:25:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:53,644 INFO L93 Difference]: Finished difference Result 206 states and 247 transitions. [2018-02-04 12:25:53,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:25:53,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:25:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:53,646 INFO L225 Difference]: With dead ends: 206 [2018-02-04 12:25:53,647 INFO L226 Difference]: Without dead ends: 206 [2018-02-04 12:25:53,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:25:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-04 12:25:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2018-02-04 12:25:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-04 12:25:53,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2018-02-04 12:25:53,657 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 14 [2018-02-04 12:25:53,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:53,657 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2018-02-04 12:25:53,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:25:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2018-02-04 12:25:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:25:53,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:53,658 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:53,658 INFO L371 AbstractCegarLoop]: === Iteration 3 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:53,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1430949362, now seen corresponding path program 1 times [2018-02-04 12:25:53,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:53,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:53,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:53,659 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:53,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:53,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:53,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:25:53,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:25:53,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:25:53,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:25:53,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:25:53,737 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand 5 states. [2018-02-04 12:25:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:53,873 INFO L93 Difference]: Finished difference Result 202 states and 243 transitions. [2018-02-04 12:25:53,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:25:53,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 12:25:53,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:53,875 INFO L225 Difference]: With dead ends: 202 [2018-02-04 12:25:53,875 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 12:25:53,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:25:53,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 12:25:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2018-02-04 12:25:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-04 12:25:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 233 transitions. [2018-02-04 12:25:53,882 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 233 transitions. Word has length 17 [2018-02-04 12:25:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:53,882 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 233 transitions. [2018-02-04 12:25:53,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:25:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 233 transitions. [2018-02-04 12:25:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:25:53,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:53,883 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:53,883 INFO L371 AbstractCegarLoop]: === Iteration 4 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:53,883 INFO L82 PathProgramCache]: Analyzing trace with hash 752800660, now seen corresponding path program 1 times [2018-02-04 12:25:53,883 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:53,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:53,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:53,884 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:53,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:53,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:53,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:25:53,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:25:53,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:25:53,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:25:53,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:25:53,927 INFO L87 Difference]: Start difference. First operand 197 states and 233 transitions. Second operand 5 states. [2018-02-04 12:25:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:54,140 INFO L93 Difference]: Finished difference Result 201 states and 242 transitions. [2018-02-04 12:25:54,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:25:54,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 12:25:54,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:54,142 INFO L225 Difference]: With dead ends: 201 [2018-02-04 12:25:54,142 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 12:25:54,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:25:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 12:25:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2018-02-04 12:25:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 12:25:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2018-02-04 12:25:54,152 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 19 [2018-02-04 12:25:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:54,152 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2018-02-04 12:25:54,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:25:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2018-02-04 12:25:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:25:54,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:54,153 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:54,153 INFO L371 AbstractCegarLoop]: === Iteration 5 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:54,153 INFO L82 PathProgramCache]: Analyzing trace with hash 752800661, now seen corresponding path program 1 times [2018-02-04 12:25:54,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:54,154 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:54,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:54,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:54,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:54,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:54,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:25:54,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:25:54,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:25:54,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:25:54,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:25:54,218 INFO L87 Difference]: Start difference. First operand 196 states and 232 transitions. Second operand 5 states. [2018-02-04 12:25:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:54,376 INFO L93 Difference]: Finished difference Result 200 states and 241 transitions. [2018-02-04 12:25:54,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:25:54,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 12:25:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:54,378 INFO L225 Difference]: With dead ends: 200 [2018-02-04 12:25:54,378 INFO L226 Difference]: Without dead ends: 200 [2018-02-04 12:25:54,378 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:25:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-04 12:25:54,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 195. [2018-02-04 12:25:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 12:25:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2018-02-04 12:25:54,386 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 19 [2018-02-04 12:25:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:54,386 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2018-02-04 12:25:54,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:25:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2018-02-04 12:25:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:25:54,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:54,387 INFO L351 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-02-04 12:25:54,387 INFO L371 AbstractCegarLoop]: === Iteration 6 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:54,387 INFO L82 PathProgramCache]: Analyzing trace with hash -439424694, now seen corresponding path program 1 times [2018-02-04 12:25:54,387 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:54,388 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:54,388 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:54,388 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:54,388 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:54,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:54,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:25:54,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:25:54,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:25:54,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:25:54,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:25:54,442 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand 5 states. [2018-02-04 12:25:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:54,484 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2018-02-04 12:25:54,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:25:54,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-04 12:25:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:54,488 INFO L225 Difference]: With dead ends: 210 [2018-02-04 12:25:54,489 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 12:25:54,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:25:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 12:25:54,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-02-04 12:25:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 12:25:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 251 transitions. [2018-02-04 12:25:54,497 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 251 transitions. Word has length 22 [2018-02-04 12:25:54,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:54,497 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 251 transitions. [2018-02-04 12:25:54,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:25:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 251 transitions. [2018-02-04 12:25:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:25:54,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:54,498 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:54,498 INFO L371 AbstractCegarLoop]: === Iteration 7 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:54,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475983, now seen corresponding path program 1 times [2018-02-04 12:25:54,498 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:54,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:54,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:54,499 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:54,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:54,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:54,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:25:54,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:25:54,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:25:54,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:25:54,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:25:54,558 INFO L87 Difference]: Start difference. First operand 210 states and 251 transitions. Second operand 6 states. [2018-02-04 12:25:54,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:54,728 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2018-02-04 12:25:54,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:25:54,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-04 12:25:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:54,731 INFO L225 Difference]: With dead ends: 208 [2018-02-04 12:25:54,731 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 12:25:54,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:25:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 12:25:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-04 12:25:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 12:25:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 249 transitions. [2018-02-04 12:25:54,739 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 249 transitions. Word has length 32 [2018-02-04 12:25:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:54,740 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 249 transitions. [2018-02-04 12:25:54,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:25:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 249 transitions. [2018-02-04 12:25:54,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:25:54,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:54,741 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:54,741 INFO L371 AbstractCegarLoop]: === Iteration 8 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:54,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475984, now seen corresponding path program 1 times [2018-02-04 12:25:54,741 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:54,741 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:54,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:54,742 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:54,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:54,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:54,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:25:54,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:25:54,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:25:54,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:25:54,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:25:54,832 INFO L87 Difference]: Start difference. First operand 208 states and 249 transitions. Second operand 8 states. [2018-02-04 12:25:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:55,069 INFO L93 Difference]: Finished difference Result 206 states and 247 transitions. [2018-02-04 12:25:55,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:25:55,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 12:25:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:55,072 INFO L225 Difference]: With dead ends: 206 [2018-02-04 12:25:55,072 INFO L226 Difference]: Without dead ends: 206 [2018-02-04 12:25:55,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:25:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-04 12:25:55,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-02-04 12:25:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 12:25:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2018-02-04 12:25:55,078 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 32 [2018-02-04 12:25:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:55,079 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2018-02-04 12:25:55,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:25:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2018-02-04 12:25:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:25:55,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:55,080 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:55,080 INFO L371 AbstractCegarLoop]: === Iteration 9 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:55,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1428852052, now seen corresponding path program 1 times [2018-02-04 12:25:55,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:55,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:55,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:55,082 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:55,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:55,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:55,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:25:55,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:25:55,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:25:55,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:25:55,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:25:55,149 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 7 states. [2018-02-04 12:25:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:55,254 INFO L93 Difference]: Finished difference Result 215 states and 261 transitions. [2018-02-04 12:25:55,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:25:55,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-04 12:25:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:55,265 INFO L225 Difference]: With dead ends: 215 [2018-02-04 12:25:55,265 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 12:25:55,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:25:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 12:25:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-02-04 12:25:55,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 12:25:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2018-02-04 12:25:55,277 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 33 [2018-02-04 12:25:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:55,278 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2018-02-04 12:25:55,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:25:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2018-02-04 12:25:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 12:25:55,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:55,280 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:55,280 INFO L371 AbstractCegarLoop]: === Iteration 10 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:55,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1006536674, now seen corresponding path program 1 times [2018-02-04 12:25:55,280 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:55,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:55,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:55,281 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:55,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:55,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:55,391 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:25:55,392 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/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-02-04 12:25:55,400 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:55,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:25:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:55,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:25:55,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-02-04 12:25:55,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:25:55,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:25:55,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:25:55,554 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand 11 states. [2018-02-04 12:25:55,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:55,697 INFO L93 Difference]: Finished difference Result 230 states and 280 transitions. [2018-02-04 12:25:55,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:25:55,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-02-04 12:25:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:55,699 INFO L225 Difference]: With dead ends: 230 [2018-02-04 12:25:55,699 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 12:25:55,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:25:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 12:25:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 216. [2018-02-04 12:25:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 12:25:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2018-02-04 12:25:55,708 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 34 [2018-02-04 12:25:55,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:55,709 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2018-02-04 12:25:55,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:25:55,709 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2018-02-04 12:25:55,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 12:25:55,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:55,710 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:55,710 INFO L371 AbstractCegarLoop]: === Iteration 11 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:55,710 INFO L82 PathProgramCache]: Analyzing trace with hash -799661844, now seen corresponding path program 2 times [2018-02-04 12:25:55,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:55,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:55,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:55,711 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:55,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:55,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:55,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:25:55,823 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/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-02-04 12:25:55,832 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:25:55,861 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:25:55,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:25:55,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:25:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:55,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:25:55,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-02-04 12:25:55,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:25:55,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:25:55,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:25:55,940 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand 12 states. [2018-02-04 12:25:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:56,073 INFO L93 Difference]: Finished difference Result 233 states and 279 transitions. [2018-02-04 12:25:56,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:25:56,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-04 12:25:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:56,074 INFO L225 Difference]: With dead ends: 233 [2018-02-04 12:25:56,074 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 12:25:56,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:25:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 12:25:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 217. [2018-02-04 12:25:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 12:25:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 260 transitions. [2018-02-04 12:25:56,081 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 260 transitions. Word has length 35 [2018-02-04 12:25:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:56,081 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 260 transitions. [2018-02-04 12:25:56,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:25:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 260 transitions. [2018-02-04 12:25:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 12:25:56,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:56,082 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:56,082 INFO L371 AbstractCegarLoop]: === Iteration 12 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:56,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1318490590, now seen corresponding path program 3 times [2018-02-04 12:25:56,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:56,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:56,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:56,083 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:25:56,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:56,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:56,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:25:56,182 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:25:56,196 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:25:56,255 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 12:25:56,255 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:25:56,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:25:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:56,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:25:56,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-02-04 12:25:56,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 12:25:56,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 12:25:56,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:25:56,327 INFO L87 Difference]: Start difference. First operand 217 states and 260 transitions. Second operand 13 states. [2018-02-04 12:25:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:56,470 INFO L93 Difference]: Finished difference Result 236 states and 283 transitions. [2018-02-04 12:25:56,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:25:56,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-04 12:25:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:56,472 INFO L225 Difference]: With dead ends: 236 [2018-02-04 12:25:56,472 INFO L226 Difference]: Without dead ends: 230 [2018-02-04 12:25:56,472 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:25:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-04 12:25:56,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 218. [2018-02-04 12:25:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 12:25:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 262 transitions. [2018-02-04 12:25:56,476 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 262 transitions. Word has length 36 [2018-02-04 12:25:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:56,477 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 262 transitions. [2018-02-04 12:25:56,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 12:25:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 262 transitions. [2018-02-04 12:25:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 12:25:56,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:56,478 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:56,478 INFO L371 AbstractCegarLoop]: === Iteration 13 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:56,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1738260692, now seen corresponding path program 4 times [2018-02-04 12:25:56,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:56,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:56,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:56,479 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:25:56,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:56,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:56,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:25:56,581 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:25:56,587 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:25:56,617 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:25:56,618 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:25:56,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:25:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:56,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:25:56,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2018-02-04 12:25:56,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 12:25:56,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 12:25:56,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:25:56,688 INFO L87 Difference]: Start difference. First operand 218 states and 262 transitions. Second operand 14 states. [2018-02-04 12:25:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:56,843 INFO L93 Difference]: Finished difference Result 239 states and 287 transitions. [2018-02-04 12:25:56,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:25:56,843 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-02-04 12:25:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:56,844 INFO L225 Difference]: With dead ends: 239 [2018-02-04 12:25:56,844 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 12:25:56,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:25:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 12:25:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2018-02-04 12:25:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 12:25:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2018-02-04 12:25:56,850 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 37 [2018-02-04 12:25:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:56,850 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2018-02-04 12:25:56,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 12:25:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2018-02-04 12:25:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:25:56,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:56,851 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:56,851 INFO L371 AbstractCegarLoop]: === Iteration 14 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:56,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2008269922, now seen corresponding path program 5 times [2018-02-04 12:25:56,852 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:56,852 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:56,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:56,852 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:25:56,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:56,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:56,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:25:56,952 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:25:56,959 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:25:56,991 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-02-04 12:25:56,991 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:25:56,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:25:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:57,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:25:57,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-02-04 12:25:57,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:25:57,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:25:57,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:25:57,087 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand 15 states. [2018-02-04 12:25:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:57,248 INFO L93 Difference]: Finished difference Result 242 states and 291 transitions. [2018-02-04 12:25:57,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:25:57,248 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-02-04 12:25:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:57,249 INFO L225 Difference]: With dead ends: 242 [2018-02-04 12:25:57,249 INFO L226 Difference]: Without dead ends: 236 [2018-02-04 12:25:57,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:25:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-04 12:25:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2018-02-04 12:25:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 12:25:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2018-02-04 12:25:57,255 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 38 [2018-02-04 12:25:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:57,256 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2018-02-04 12:25:57,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:25:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2018-02-04 12:25:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 12:25:57,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:57,257 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:57,257 INFO L371 AbstractCegarLoop]: === Iteration 15 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:57,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1788621460, now seen corresponding path program 6 times [2018-02-04 12:25:57,257 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:57,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:57,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:57,258 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:25:57,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:57,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:57,370 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:25:57,370 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:25:57,379 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:25:57,592 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-02-04 12:25:57,593 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:25:57,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:25:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:57,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:25:57,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 16 [2018-02-04 12:25:57,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 12:25:57,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 12:25:57,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:25:57,670 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand 16 states. [2018-02-04 12:25:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:57,901 INFO L93 Difference]: Finished difference Result 245 states and 295 transitions. [2018-02-04 12:25:57,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 12:25:57,901 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-02-04 12:25:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:57,902 INFO L225 Difference]: With dead ends: 245 [2018-02-04 12:25:57,902 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 12:25:57,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-02-04 12:25:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 12:25:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 221. [2018-02-04 12:25:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-04 12:25:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 268 transitions. [2018-02-04 12:25:57,909 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 268 transitions. Word has length 39 [2018-02-04 12:25:57,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:57,909 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 268 transitions. [2018-02-04 12:25:57,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 12:25:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2018-02-04 12:25:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 12:25:57,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:57,910 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:57,910 INFO L371 AbstractCegarLoop]: === Iteration 16 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash 725513566, now seen corresponding path program 7 times [2018-02-04 12:25:57,912 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:57,912 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:57,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:57,913 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:25:57,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:57,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:58,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:25:58,068 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:25:58,075 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:58,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:25:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:25:58,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:25:58,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 17 [2018-02-04 12:25:58,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:25:58,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:25:58,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:25:58,142 INFO L87 Difference]: Start difference. First operand 221 states and 268 transitions. Second operand 17 states. [2018-02-04 12:25:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:25:58,354 INFO L93 Difference]: Finished difference Result 248 states and 299 transitions. [2018-02-04 12:25:58,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:25:58,355 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-02-04 12:25:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:25:58,356 INFO L225 Difference]: With dead ends: 248 [2018-02-04 12:25:58,356 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 12:25:58,356 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:25:58,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 12:25:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2018-02-04 12:25:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-04 12:25:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 270 transitions. [2018-02-04 12:25:58,362 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 270 transitions. Word has length 40 [2018-02-04 12:25:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:25:58,362 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 270 transitions. [2018-02-04 12:25:58,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:25:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 270 transitions. [2018-02-04 12:25:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:25:58,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:25:58,363 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:25:58,363 INFO L371 AbstractCegarLoop]: === Iteration 17 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:25:58,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1354288044, now seen corresponding path program 8 times [2018-02-04 12:25:58,363 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:25:58,363 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:25:58,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:58,364 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:25:58,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:25:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:25:58,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:25:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-04 12:25:58,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:25:58,613 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:25:58,620 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:25:58,661 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:25:58,661 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:25:58,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:25:58,681 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-02-04 12:25:58,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:25:58,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:58,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:25:58,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:25:58,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:25:58,715 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-02-04 12:25:58,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:25:58,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:58,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-02-04 12:25:58,744 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:25:58,746 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 10 treesize of output 9 [2018-02-04 12:25:58,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:25:58,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:58,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:58,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-02-04 12:25:58,798 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 18 treesize of output 14 [2018-02-04 12:25:58,799 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-02-04 12:25:58,800 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:25:58,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:25:58,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:25:58,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-02-04 12:25:58,883 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_3 Int) (v_DUPFFnew_~ans~0.base_BEFORE_CALL_1 Int)) (and (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_1) 1) (not (= v_arrayElimCell_3 v_DUPFFnew_~ans~0.base_BEFORE_CALL_1)) (= 1 (select |c_#valid| v_arrayElimCell_3)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_33| Int) (|v_#Ultimate.C_memset_#t~loopctr54_35| Int) (|v_#Ultimate.C_memset_#t~loopctr54_34| Int)) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_33|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_34|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_35|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-04 12:25:59,000 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_3 Int) (v_DUPFFnew_~ans~0.base_BEFORE_CALL_1 Int)) (and (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_1) 1) (not (= v_arrayElimCell_3 v_DUPFFnew_~ans~0.base_BEFORE_CALL_1)) (= 1 (select |c_#valid| v_arrayElimCell_3)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_37| Int) (|v_#Ultimate.C_memset_#t~loopctr54_36| Int) (|v_#Ultimate.C_memset_#t~loopctr54_38| Int) (|v_#Ultimate.C_memset_#t~loopctr54_33| Int) (|v_#Ultimate.C_memset_#t~loopctr54_35| Int) (|v_#Ultimate.C_memset_#t~loopctr54_34| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_33|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_34|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_35|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_36| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_37| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_38|) 0))))) is different from true [2018-02-04 12:25:59,355 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2018-02-04 12:25:59,357 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-02-04 12:25:59,360 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-02-04 12:25:59,364 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 56 treesize of output 58 [2018-02-04 12:25:59,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2018-02-04 12:25:59,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2018-02-04 12:25:59,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2018-02-04 12:25:59,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2018-02-04 12:25:59,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 121 [2018-02-04 12:25:59,499 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:25:59,508 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:59,517 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:59,527 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:59,536 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:59,545 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:59,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:59,564 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:59,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:59,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-02-04 12:25:59,593 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:104, output treesize:164 [2018-02-04 12:25:59,679 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 109 [2018-02-04 12:25:59,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:25:59,683 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 134 treesize of output 148 [2018-02-04 12:25:59,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:25:59,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:59,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-02-04 12:25:59,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:165, output treesize:150 [2018-02-04 12:25:59,722 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 113 [2018-02-04 12:25:59,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:25:59,726 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 138 treesize of output 150 [2018-02-04 12:25:59,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:25:59,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:25:59,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-02-04 12:25:59,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:169, output treesize:150 [2018-02-04 12:25:59,994 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 75 [2018-02-04 12:25:59,996 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 19 treesize of output 10 [2018-02-04 12:25:59,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:00,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 1 [2018-02-04 12:26:00,032 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:00,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:00,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:00,040 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:134, output treesize:15 [2018-02-04 12:26:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 15 times theorem prover too weak. 0 trivial. 15 not checked. [2018-02-04 12:26:00,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:00,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 34 [2018-02-04 12:26:00,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 12:26:00,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 12:26:00,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=785, Unknown=179, NotChecked=126, Total=1190 [2018-02-04 12:26:00,104 INFO L87 Difference]: Start difference. First operand 222 states and 270 transitions. Second operand 35 states. [2018-02-04 12:26:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:09,731 INFO L93 Difference]: Finished difference Result 267 states and 328 transitions. [2018-02-04 12:26:09,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 12:26:09,731 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2018-02-04 12:26:09,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:09,732 INFO L225 Difference]: With dead ends: 267 [2018-02-04 12:26:09,732 INFO L226 Difference]: Without dead ends: 267 [2018-02-04 12:26:09,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=279, Invalid=2322, Unknown=377, NotChecked=214, Total=3192 [2018-02-04 12:26:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-04 12:26:09,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 221. [2018-02-04 12:26:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-04 12:26:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 269 transitions. [2018-02-04 12:26:09,738 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 269 transitions. Word has length 41 [2018-02-04 12:26:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:09,738 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 269 transitions. [2018-02-04 12:26:09,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 12:26:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 269 transitions. [2018-02-04 12:26:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:26:09,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:09,740 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:26:09,740 INFO L371 AbstractCegarLoop]: === Iteration 18 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:26:09,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1354288045, now seen corresponding path program 1 times [2018-02-04 12:26:09,740 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:09,740 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:09,741 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:09,741 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:09,741 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:09,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-04 12:26:10,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:10,179 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:26:10,184 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:10,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:10,253 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-02-04 12:26:10,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:10,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:10,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:10,262 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 11 treesize of output 4 [2018-02-04 12:26:10,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:10,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:10,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-02-04 12:26:10,288 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:26:10,290 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-02-04 12:26:10,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:10,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:10,368 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:26:10,370 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 10 treesize of output 9 [2018-02-04 12:26:10,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:10,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:10,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:10,379 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:38 [2018-02-04 12:26:10,432 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 9 treesize of output 7 [2018-02-04 12:26:10,434 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-02-04 12:26:10,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:10,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:10,440 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 26 treesize of output 22 [2018-02-04 12:26:10,442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 12:26:10,442 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:10,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:10,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:10,450 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:16 [2018-02-04 12:26:10,481 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 (mod |c_#Ultimate.C_memset_#value| 256)))))))) is different from true [2018-02-04 12:26:10,486 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0)) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse2 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse2) .cse1 .cse2))) |c_#memory_$Pointer$.offset|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-04 12:26:10,492 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse3 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse3) .cse1 .cse3) .cse2 .cse3))))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-04 12:26:10,499 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse4 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse4) .cse1 .cse4) .cse2 .cse4) .cse3 .cse4))) |c_#memory_$Pointer$.offset|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-04 12:26:10,505 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_45| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_45|))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0)) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse5 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse5) .cse1 .cse5) .cse2 .cse5) .cse3 .cse5) .cse4 .cse5))) |c_#memory_$Pointer$.offset|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-04 12:26:10,512 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_46| Int) (|v_#Ultimate.C_memset_#t~loopctr54_45| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_45|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_46|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse6 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse6) .cse1 .cse6) .cse2 .cse6) .cse3 .cse6) .cse4 .cse6) .cse5 .cse6))))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-04 12:26:10,520 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_47| Int) (|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_46| Int) (|v_#Ultimate.C_memset_#t~loopctr54_45| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_45|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_46|)) (.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr54_47| |c_#Ultimate.C_memset_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1) .cse7 .cse1))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0)) |c_#memory_$Pointer$.base|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-04 12:26:10,542 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_48| Int) (|v_#Ultimate.C_memset_#t~loopctr54_47| Int) (|#Ultimate.C_memset_#ptr.offset| Int) (|#Ultimate.C_memset_#value| Int) (|v_#Ultimate.C_memset_#t~loopctr54_44| Int) (|v_#Ultimate.C_memset_#t~loopctr54_43| Int) (|v_#Ultimate.C_memset_#t~loopctr54_46| Int) (|v_#Ultimate.C_memset_#t~loopctr54_45| Int) (|v_#Ultimate.C_memset_#t~loopctr54_42| Int) (|v_#Ultimate.C_memset_#t~loopctr54_41| Int)) (let ((.cse0 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_41|)) (.cse2 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_42|)) (.cse3 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_43|)) (.cse4 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_44|)) (.cse5 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_45|)) (.cse6 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_46|)) (.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr54_47| |#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ |v_#Ultimate.C_memset_#t~loopctr54_48| |#Ultimate.C_memset_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1) .cse7 .cse1) .cse8 .cse1))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0)) |c_#memory_$Pointer$.base|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-02-04 12:26:10,575 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2018-02-04 12:26:10,579 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-02-04 12:26:10,586 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-02-04 12:26:10,601 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 56 treesize of output 58 [2018-02-04 12:26:10,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 60 [2018-02-04 12:26:10,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2018-02-04 12:26:10,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2018-02-04 12:26:10,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2018-02-04 12:26:10,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 121 [2018-02-04 12:26:10,888 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:10,921 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:10,957 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:10,996 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,032 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,088 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,161 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,299 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 86 treesize of output 87 [2018-02-04 12:26:11,302 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2018-02-04 12:26:11,307 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 72 [2018-02-04 12:26:11,315 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 72 treesize of output 74 [2018-02-04 12:26:11,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2018-02-04 12:26:11,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 78 [2018-02-04 12:26:11,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 80 [2018-02-04 12:26:11,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 82 [2018-02-04 12:26:11,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 137 [2018-02-04 12:26:11,416 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,433 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,450 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,467 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,484 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,501 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,517 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,533 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,559 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:11,610 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 15 variables, input treesize:183, output treesize:303 [2018-02-04 12:26:11,724 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 233 [2018-02-04 12:26:11,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:11,733 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 258 treesize of output 288 [2018-02-04 12:26:11,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,851 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 161 treesize of output 166 [2018-02-04 12:26:11,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:11,856 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 20 treesize of output 16 [2018-02-04 12:26:11,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:11,919 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:324, output treesize:294 [2018-02-04 12:26:11,929 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 165 treesize of output 170 [2018-02-04 12:26:11,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:11,935 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 24 treesize of output 18 [2018-02-04 12:26:11,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:11,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:12,010 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 237 [2018-02-04 12:26:12,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:12,015 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 262 treesize of output 290 [2018-02-04 12:26:12,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:12,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:12,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:12,094 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:332, output treesize:294 [2018-02-04 12:26:12,336 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 291 treesize of output 205 [2018-02-04 12:26:12,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 1 [2018-02-04 12:26:12,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:12,386 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 149 treesize of output 102 [2018-02-04 12:26:12,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:12,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:12,426 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 107 treesize of output 91 [2018-02-04 12:26:12,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 1 [2018-02-04 12:26:12,450 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:12,454 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-02-04 12:26:12,454 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:12,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:12,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:12,459 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 15 variables, input treesize:312, output treesize:16 [2018-02-04 12:26:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2018-02-04 12:26:12,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:12,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 35 [2018-02-04 12:26:12,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 12:26:12,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 12:26:12,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=687, Unknown=8, NotChecked=472, Total=1260 [2018-02-04 12:26:12,512 INFO L87 Difference]: Start difference. First operand 221 states and 269 transitions. Second operand 36 states. [2018-02-04 12:26:13,706 WARN L146 SmtUtils]: Spent 648ms on a formula simplification. DAG size of input: 69 DAG size of output 54 [2018-02-04 12:26:22,764 WARN L146 SmtUtils]: Spent 529ms on a formula simplification. DAG size of input: 121 DAG size of output 111 [2018-02-04 12:26:23,038 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 182 DAG size of output 165 [2018-02-04 12:26:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:27,126 INFO L93 Difference]: Finished difference Result 251 states and 309 transitions. [2018-02-04 12:26:27,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 12:26:27,127 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 41 [2018-02-04 12:26:27,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:27,128 INFO L225 Difference]: With dead ends: 251 [2018-02-04 12:26:27,128 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 12:26:27,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=378, Invalid=2812, Unknown=148, NotChecked=952, Total=4290 [2018-02-04 12:26:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 12:26:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 220. [2018-02-04 12:26:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 12:26:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 268 transitions. [2018-02-04 12:26:27,133 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 268 transitions. Word has length 41 [2018-02-04 12:26:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:27,133 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 268 transitions. [2018-02-04 12:26:27,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 12:26:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 268 transitions. [2018-02-04 12:26:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 12:26:27,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:27,134 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:26:27,134 INFO L371 AbstractCegarLoop]: === Iteration 19 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:26:27,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1158116567, now seen corresponding path program 1 times [2018-02-04 12:26:27,134 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:27,134 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:27,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:27,135 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:27,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:27,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-02-04 12:26:27,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:26:27,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:26:27,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:26:27,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:26:27,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:26:27,226 INFO L87 Difference]: Start difference. First operand 220 states and 268 transitions. Second operand 6 states. [2018-02-04 12:26:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:27,357 INFO L93 Difference]: Finished difference Result 218 states and 266 transitions. [2018-02-04 12:26:27,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:26:27,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-02-04 12:26:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:27,358 INFO L225 Difference]: With dead ends: 218 [2018-02-04 12:26:27,358 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 12:26:27,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:26:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 12:26:27,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-04 12:26:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 12:26:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 266 transitions. [2018-02-04 12:26:27,362 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 266 transitions. Word has length 74 [2018-02-04 12:26:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:27,363 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 266 transitions. [2018-02-04 12:26:27,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:26:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 266 transitions. [2018-02-04 12:26:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 12:26:27,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:27,364 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:26:27,364 INFO L371 AbstractCegarLoop]: === Iteration 20 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:26:27,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1158116568, now seen corresponding path program 1 times [2018-02-04 12:26:27,364 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:27,364 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:27,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:27,364 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:27,365 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:27,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-02-04 12:26:27,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:26:27,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:26:27,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:26:27,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:26:27,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:26:27,468 INFO L87 Difference]: Start difference. First operand 218 states and 266 transitions. Second operand 8 states. [2018-02-04 12:26:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:27,599 INFO L93 Difference]: Finished difference Result 216 states and 264 transitions. [2018-02-04 12:26:27,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:26:27,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-02-04 12:26:27,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:27,600 INFO L225 Difference]: With dead ends: 216 [2018-02-04 12:26:27,600 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 12:26:27,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:26:27,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 12:26:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-04 12:26:27,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 12:26:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 264 transitions. [2018-02-04 12:26:27,603 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 264 transitions. Word has length 74 [2018-02-04 12:26:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:27,603 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 264 transitions. [2018-02-04 12:26:27,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:26:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 264 transitions. [2018-02-04 12:26:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 12:26:27,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:27,604 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:26:27,604 INFO L371 AbstractCegarLoop]: === Iteration 21 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:26:27,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1541875248, now seen corresponding path program 1 times [2018-02-04 12:26:27,604 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:27,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:27,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:27,604 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:27,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:27,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 12:26:27,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:27,728 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:26:27,737 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:27,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 12:26:27,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:27,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-04 12:26:27,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:26:27,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:26:27,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:26:27,815 INFO L87 Difference]: Start difference. First operand 216 states and 264 transitions. Second operand 15 states. [2018-02-04 12:26:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:27,976 INFO L93 Difference]: Finished difference Result 254 states and 317 transitions. [2018-02-04 12:26:27,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 12:26:27,976 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2018-02-04 12:26:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:27,977 INFO L225 Difference]: With dead ends: 254 [2018-02-04 12:26:27,977 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 12:26:27,978 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2018-02-04 12:26:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 12:26:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 228. [2018-02-04 12:26:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 12:26:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 281 transitions. [2018-02-04 12:26:27,984 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 281 transitions. Word has length 75 [2018-02-04 12:26:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:27,984 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 281 transitions. [2018-02-04 12:26:27,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:26:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 281 transitions. [2018-02-04 12:26:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 12:26:27,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:27,985 INFO L351 BasicCegarLoop]: trace histogram [17, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:26:27,985 INFO L371 AbstractCegarLoop]: === Iteration 22 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:26:27,985 INFO L82 PathProgramCache]: Analyzing trace with hash 889551470, now seen corresponding path program 2 times [2018-02-04 12:26:27,985 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:27,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:27,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:27,986 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:26:27,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:28,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:28,142 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 106 proven. 45 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 12:26:28,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:28,143 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:26:28,148 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:26:28,196 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:26:28,196 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:28,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 106 proven. 45 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 12:26:28,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:28,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-02-04 12:26:28,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 12:26:28,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 12:26:28,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:26:28,238 INFO L87 Difference]: Start difference. First operand 228 states and 281 transitions. Second operand 16 states. [2018-02-04 12:26:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:28,424 INFO L93 Difference]: Finished difference Result 257 states and 322 transitions. [2018-02-04 12:26:28,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 12:26:28,426 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-02-04 12:26:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:28,427 INFO L225 Difference]: With dead ends: 257 [2018-02-04 12:26:28,427 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 12:26:28,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:26:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 12:26:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2018-02-04 12:26:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 12:26:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2018-02-04 12:26:28,432 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 76 [2018-02-04 12:26:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:28,433 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2018-02-04 12:26:28,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 12:26:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2018-02-04 12:26:28,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 12:26:28,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:28,434 INFO L351 BasicCegarLoop]: trace histogram [18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:26:28,434 INFO L371 AbstractCegarLoop]: === Iteration 23 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:26:28,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2142350832, now seen corresponding path program 3 times [2018-02-04 12:26:28,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:28,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:28,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:28,435 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:28,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:28,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 12:26:28,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:28,585 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:26:28,593 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:26:42,578 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-04 12:26:42,578 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:42,583 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 12:26:42,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:42,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-04 12:26:42,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:26:42,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:26:42,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:26:42,625 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand 17 states. [2018-02-04 12:26:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:42,746 INFO L93 Difference]: Finished difference Result 260 states and 327 transitions. [2018-02-04 12:26:42,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 12:26:42,747 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 77 [2018-02-04 12:26:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:42,748 INFO L225 Difference]: With dead ends: 260 [2018-02-04 12:26:42,748 INFO L226 Difference]: Without dead ends: 254 [2018-02-04 12:26:42,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:26:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-02-04 12:26:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2018-02-04 12:26:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-04 12:26:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 288 transitions. [2018-02-04 12:26:42,753 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 288 transitions. Word has length 77 [2018-02-04 12:26:42,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:42,753 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 288 transitions. [2018-02-04 12:26:42,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:26:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 288 transitions. [2018-02-04 12:26:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 12:26:42,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:42,753 INFO L351 BasicCegarLoop]: trace histogram [19, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:26:42,753 INFO L371 AbstractCegarLoop]: === Iteration 24 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:26:42,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1970541906, now seen corresponding path program 4 times [2018-02-04 12:26:42,754 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:42,754 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:42,754 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:42,754 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:42,754 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:42,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 124 proven. 66 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 12:26:42,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:42,890 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:26:42,895 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:26:42,955 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:26:42,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:42,958 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 124 proven. 66 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 12:26:43,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:43,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-02-04 12:26:43,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:26:43,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:26:43,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:26:43,001 INFO L87 Difference]: Start difference. First operand 232 states and 288 transitions. Second operand 18 states. [2018-02-04 12:26:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:26:43,249 INFO L93 Difference]: Finished difference Result 263 states and 332 transitions. [2018-02-04 12:26:43,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 12:26:43,250 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-02-04 12:26:43,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:26:43,251 INFO L225 Difference]: With dead ends: 263 [2018-02-04 12:26:43,251 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 12:26:43,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=296, Invalid=634, Unknown=0, NotChecked=0, Total=930 [2018-02-04 12:26:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 12:26:43,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2018-02-04 12:26:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-04 12:26:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 290 transitions. [2018-02-04 12:26:43,257 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 290 transitions. Word has length 78 [2018-02-04 12:26:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:26:43,257 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 290 transitions. [2018-02-04 12:26:43,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:26:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 290 transitions. [2018-02-04 12:26:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 12:26:43,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:26:43,258 INFO L351 BasicCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:26:43,258 INFO L371 AbstractCegarLoop]: === Iteration 25 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:26:43,259 INFO L82 PathProgramCache]: Analyzing trace with hash -621197904, now seen corresponding path program 5 times [2018-02-04 12:26:43,259 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:26:43,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:26:43,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:43,259 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:26:43,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:26:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:26:43,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:26:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 125 proven. 82 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-04 12:26:43,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:26:43,819 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:26:43,823 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:26:54,738 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-04 12:26:54,738 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:26:54,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:26:54,748 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-02-04 12:26:54,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:54,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:54,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:26:54,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:54,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:54,790 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-02-04 12:26:54,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:54,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:54,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 12:26:54,812 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:26:54,813 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 10 treesize of output 9 [2018-02-04 12:26:54,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:54,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:54,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:54,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-02-04 12:26:54,860 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 22 treesize of output 18 [2018-02-04 12:26:54,861 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-04 12:26:54,862 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:54,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:54,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:54,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-02-04 12:26:54,892 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_87| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0))))) is different from true [2018-02-04 12:26:54,896 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0))))) is different from true [2018-02-04 12:26:54,899 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int)) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-04 12:26:54,904 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0))))) is different from true [2018-02-04 12:26:54,909 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int)) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-04 12:26:54,914 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |c_#Ultimate.C_memset_#ptr.offset|) 0))))) is different from true [2018-02-04 12:26:54,919 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_93| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int)) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_93| |c_#Ultimate.C_memset_#ptr.offset|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-04 12:26:54,925 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_93| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int) (|v_#Ultimate.C_memset_#t~loopctr54_94| Int)) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_93| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_94|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-04 12:26:54,931 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_93| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int) (|v_#Ultimate.C_memset_#t~loopctr54_95| Int) (|v_#Ultimate.C_memset_#t~loopctr54_94| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_93| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_94|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_95|) 0))))) is different from true [2018-02-04 12:26:54,951 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_93| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int) (|v_#Ultimate.C_memset_#t~loopctr54_95| Int) (|v_#Ultimate.C_memset_#t~loopctr54_94| Int) (|v_#Ultimate.C_memset_#t~loopctr54_96| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_93| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_94|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_95|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_96|) 0))))) is different from true [2018-02-04 12:26:54,963 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_93| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int) (|v_#Ultimate.C_memset_#t~loopctr54_95| Int) (|v_#Ultimate.C_memset_#t~loopctr54_94| Int) (|v_#Ultimate.C_memset_#t~loopctr54_97| Int) (|v_#Ultimate.C_memset_#t~loopctr54_96| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_93| |c_#Ultimate.C_memset_#ptr.offset|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_94|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_95|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_96|) 0) (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_97|) 0))))) is different from true [2018-02-04 12:26:54,974 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_DUPFFnew_~ans~0.base_BEFORE_CALL_3 Int) (v_arrayElimCell_26 Int)) (and (= 1 (select |c_#valid| v_arrayElimCell_26)) (not (= v_arrayElimCell_26 v_DUPFFnew_~ans~0.base_BEFORE_CALL_3)) (= (select |c_#valid| v_DUPFFnew_~ans~0.base_BEFORE_CALL_3) 1))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_91| Int) (|v_#Ultimate.C_memset_#t~loopctr54_90| Int) (|v_#Ultimate.C_memset_#t~loopctr54_93| Int) (|v_#Ultimate.C_memset_#t~loopctr54_92| Int) (|v_#Ultimate.C_memset_#t~loopctr54_88| Int) (|v_#Ultimate.C_memset_#t~loopctr54_87| Int) (|v_#Ultimate.C_memset_#t~loopctr54_98| Int) (|v_#Ultimate.C_memset_#t~loopctr54_89| Int) (|v_#Ultimate.C_memset_#t~loopctr54_95| Int) (|v_#Ultimate.C_memset_#t~loopctr54_94| Int) (|v_#Ultimate.C_memset_#t~loopctr54_97| Int) (|v_#Ultimate.C_memset_#t~loopctr54_96| Int) (|#Ultimate.C_memset_#ptr.offset| Int)) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_87|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_88|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_89|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_90| |#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_91| |#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_92| |#Ultimate.C_memset_#ptr.offset|) 0) (+ |v_#Ultimate.C_memset_#t~loopctr54_93| |#Ultimate.C_memset_#ptr.offset|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_94|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_95|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_96|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_97|) 0) (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_98|) 0)) |c_#memory_$Pointer$.base|))) is different from true [2018-02-04 12:26:55,072 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2018-02-04 12:26:55,075 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2018-02-04 12:26:55,078 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2018-02-04 12:26:55,092 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 76 treesize of output 78 [2018-02-04 12:26:55,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 80 [2018-02-04 12:26:55,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 82 [2018-02-04 12:26:55,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 84 [2018-02-04 12:26:55,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 86 [2018-02-04 12:26:55,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 88 [2018-02-04 12:26:55,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2018-02-04 12:26:55,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 92 [2018-02-04 12:26:55,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 94 [2018-02-04 12:26:55,434 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-02-04 12:26:55,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 181 [2018-02-04 12:26:55,436 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,457 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,477 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,497 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,527 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,557 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,595 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,617 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,658 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,687 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 1 dim-2 vars, End of recursive call: 15 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:55,785 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 16 variables, input treesize:121, output treesize:221 [2018-02-04 12:26:55,876 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 145 [2018-02-04 12:26:55,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:55,889 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 186 treesize of output 208 [2018-02-04 12:26:55,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 1 dim-2 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:55,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 14 variables, input treesize:222, output treesize:207 [2018-02-04 12:26:55,953 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 149 [2018-02-04 12:26:55,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:26:55,957 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 190 treesize of output 210 [2018-02-04 12:26:55,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:55,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:56,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 1 dim-2 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:56,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 14 variables, input treesize:226, output treesize:207 [2018-02-04 12:26:56,363 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 211 treesize of output 109 [2018-02-04 12:26:56,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 1 [2018-02-04 12:26:56,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:56,427 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 25 treesize of output 10 [2018-02-04 12:26:56,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:26:56,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:26:56,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:26:56,433 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:216, output treesize:15 [2018-02-04 12:26:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 78 not checked. [2018-02-04 12:26:56,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:26:56,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 50 [2018-02-04 12:26:56,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 12:26:56,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 12:26:56,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1384, Unknown=12, NotChecked=1020, Total=2550 [2018-02-04 12:26:56,524 INFO L87 Difference]: Start difference. First operand 233 states and 290 transitions. Second operand 51 states. [2018-02-04 12:27:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:27:19,992 INFO L93 Difference]: Finished difference Result 280 states and 354 transitions. [2018-02-04 12:27:19,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 12:27:19,993 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 79 [2018-02-04 12:27:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:27:19,994 INFO L225 Difference]: With dead ends: 280 [2018-02-04 12:27:19,994 INFO L226 Difference]: Without dead ends: 280 [2018-02-04 12:27:19,996 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=415, Invalid=4248, Unknown=77, NotChecked=1740, Total=6480 [2018-02-04 12:27:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-04 12:27:20,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 241. [2018-02-04 12:27:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-04 12:27:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 301 transitions. [2018-02-04 12:27:20,001 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 301 transitions. Word has length 79 [2018-02-04 12:27:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:27:20,001 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 301 transitions. [2018-02-04 12:27:20,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 12:27:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 301 transitions. [2018-02-04 12:27:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 12:27:20,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:27:20,002 INFO L351 BasicCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:27:20,003 INFO L371 AbstractCegarLoop]: === Iteration 26 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 12:27:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash -621197903, now seen corresponding path program 1 times [2018-02-04 12:27:20,003 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:27:20,003 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:27:20,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:20,004 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:27:20,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:27:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:20,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:27:20,640 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 133 proven. 14 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-02-04 12:27:20,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:27:20,641 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:27:20,647 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:27:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:27:20,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:27:20,754 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-02-04 12:27:20,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:20,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:27:20,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:27:20,763 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 11 treesize of output 4 [2018-02-04 12:27:20,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:20,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:27:20,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-02-04 12:27:20,789 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:27:20,791 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-02-04 12:27:20,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:20,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:20,811 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 12:27:20,812 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 10 treesize of output 9 [2018-02-04 12:27:20,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:20,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:20,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:27:20,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:38 [2018-02-04 12:27:20,920 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 26 treesize of output 22 [2018-02-04 12:27:20,922 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 12:27:20,922 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:27:20,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:27:20,936 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 9 treesize of output 7 [2018-02-04 12:27:20,938 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-02-04 12:27:20,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:20,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:20,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:27:20,946 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:16 [2018-02-04 12:27:20,979 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_99| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 (mod |c_#Ultimate.C_memset_#value| 256)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0)))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-04 12:27:20,985 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse2 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0))))))) is different from true [2018-02-04 12:27:20,992 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse2 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0)))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-04 12:27:20,999 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse4 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse4) .cse1 .cse4) .cse2 .cse4) .cse3 .cse4))) |c_#memory_$Pointer$.offset|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-04 12:27:21,007 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse5 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse5) .cse1 .cse5) .cse2 .cse5) .cse3 .cse5) .cse4 .cse5)))))))) is different from true [2018-02-04 12:27:21,016 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse2 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0)))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-04 12:27:21,027 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int) (|v_#Ultimate.C_memset_#t~loopctr54_105| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_105|))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0)) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse7 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse7) .cse1 .cse7) .cse2 .cse7) .cse3 .cse7) .cse4 .cse7) .cse5 .cse7) .cse6 .cse7))) |c_#memory_$Pointer$.offset|))))) is different from true [2018-02-04 12:27:21,037 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_106| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int) (|v_#Ultimate.C_memset_#t~loopctr54_105| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_105|)) (.cse7 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_106|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse8 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse8) .cse1 .cse8) .cse2 .cse8) .cse3 .cse8) .cse4 .cse8) .cse5 .cse8) .cse6 .cse8) .cse7 .cse8))))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-04 12:27:21,046 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35))) (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_106| Int) (|v_#Ultimate.C_memset_#t~loopctr54_107| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int) (|v_#Ultimate.C_memset_#t~loopctr54_105| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_105|)) (.cse7 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_106|)) (.cse8 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_107|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse9 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse9) .cse1 .cse9) .cse2 .cse9) .cse3 .cse9) .cse4 .cse9) .cse5 .cse9) .cse6 .cse9) .cse7 .cse9) .cse8 .cse9)))))))) is different from true [2018-02-04 12:27:21,057 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_106| Int) (|v_#Ultimate.C_memset_#t~loopctr54_107| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int) (|v_#Ultimate.C_memset_#t~loopctr54_105| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse2 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|)) (.cse7 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_105|)) (.cse8 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_106|)) (.cse9 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_107|)) (.cse10 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1) .cse7 .cse1) .cse8 .cse1) .cse9 .cse1) .cse10 .cse1))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0) .cse9 0) .cse10 0)) |c_#memory_$Pointer$.base|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-04 12:27:21,069 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_106| Int) (|v_#Ultimate.C_memset_#t~loopctr54_107| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int) (|v_#Ultimate.C_memset_#t~loopctr54_105| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse2 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |c_#Ultimate.C_memset_#ptr.offset|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|)) (.cse7 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_105|)) (.cse8 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_106|)) (.cse9 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_107|)) (.cse10 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse11 (+ |c_#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (mod |c_#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1) .cse6 .cse1) .cse7 .cse1) .cse8 .cse1) .cse9 .cse1) .cse10 .cse1) .cse11 .cse1)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0) .cse9 0) .cse10 0) .cse11 0)))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35)))) is different from true [2018-02-04 12:27:21,091 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_35 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_35))) (exists ((|#Ultimate.C_memset_#value| Int) (|v_#Ultimate.C_memset_#t~loopctr54_99| Int) (|v_#Ultimate.C_memset_#t~loopctr54_110| Int) (|v_#Ultimate.C_memset_#t~loopctr54_102| Int) (|v_#Ultimate.C_memset_#t~loopctr54_103| Int) (|v_#Ultimate.C_memset_#t~loopctr54_100| Int) (|#Ultimate.C_memset_#ptr.offset| Int) (|v_#Ultimate.C_memset_#t~loopctr54_101| Int) (|v_#Ultimate.C_memset_#t~loopctr54_106| Int) (|v_#Ultimate.C_memset_#t~loopctr54_107| Int) (|v_#Ultimate.C_memset_#t~loopctr54_104| Int) (|v_#Ultimate.C_memset_#t~loopctr54_105| Int) (|v_#Ultimate.C_memset_#t~loopctr54_108| Int) (|v_#Ultimate.C_memset_#t~loopctr54_109| Int)) (let ((.cse0 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_99|)) (.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr54_100| |#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_101|)) (.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr54_102| |#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr54_103| |#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_104|)) (.cse6 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_105|)) (.cse7 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_106|)) (.cse8 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_107|)) (.cse9 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_108|)) (.cse10 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr54_109|)) (.cse11 (+ |v_#Ultimate.C_memset_#t~loopctr54_110| |#Ultimate.C_memset_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse1 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0) .cse9 0) .cse10 0) .cse11 0)) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse12 (mod |#Ultimate.C_memset_#value| 256))) (store (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse12) .cse1 .cse12) .cse2 .cse12) .cse3 .cse12) .cse4 .cse12) .cse5 .cse12) .cse6 .cse12) .cse7 .cse12) .cse8 .cse12) .cse9 .cse12) .cse10 .cse12) .cse11 .cse12)))))))) is different from true [2018-02-04 12:27:21,170 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 114 treesize of output 115 [2018-02-04 12:27:21,177 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 98 [2018-02-04 12:27:21,194 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 100 [2018-02-04 12:27:21,234 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 100 treesize of output 102 [2018-02-04 12:27:21,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 104 [2018-02-04 12:27:21,467 INFO L303 Elim1Store]: Index analysis took 140 ms [2018-02-04 12:27:21,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 106 [2018-02-04 12:27:21,693 INFO L303 Elim1Store]: Index analysis took 224 ms [2018-02-04 12:27:21,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 108 [2018-02-04 12:27:22,010 INFO L303 Elim1Store]: Index analysis took 315 ms [2018-02-04 12:27:22,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 110 [2018-02-04 12:27:22,393 INFO L303 Elim1Store]: Index analysis took 379 ms [2018-02-04 12:27:22,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 112 [2018-02-04 12:27:22,943 INFO L303 Elim1Store]: Index analysis took 549 ms [2018-02-04 12:27:22,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 114 [2018-02-04 12:27:23,598 INFO L303 Elim1Store]: Index analysis took 652 ms [2018-02-04 12:27:23,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 116 [2018-02-04 12:27:24,387 INFO L303 Elim1Store]: Index analysis took 787 ms [2018-02-04 12:27:24,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 118 [2018-02-04 12:27:25,300 INFO L303 Elim1Store]: Index analysis took 911 ms [2018-02-04 12:27:25,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 205 [2018-02-04 12:27:25,301 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:25,472 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:25,646 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:25,812 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:25,994 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:26,184 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:26,363 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:26,536 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:26,709 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:26,886 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:27,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:27,206 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:27,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:27,709 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 304 [2018-02-04 12:27:27,713 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2018-02-04 12:27:27,717 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2018-02-04 12:27:27,727 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 76 treesize of output 78 [2018-02-04 12:27:27,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 80 [2018-02-04 12:27:27,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 82 [2018-02-04 12:27:27,959 INFO L303 Elim1Store]: Index analysis took 123 ms [2018-02-04 12:27:27,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 84 [2018-02-04 12:27:27,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 86 [2018-02-04 12:27:28,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 88 [2018-02-04 12:27:28,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2018-02-04 12:27:28,282 INFO L303 Elim1Store]: Index analysis took 220 ms [2018-02-04 12:27:28,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 92 [2018-02-04 12:27:28,491 INFO L303 Elim1Store]: Index analysis took 207 ms [2018-02-04 12:27:28,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 94 [2018-02-04 12:27:28,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 181 [2018-02-04 12:27:28,557 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:28,580 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:28,603 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:28,625 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:28,647 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:28,671 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:28,695 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:28,718 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:28,741 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:28,764 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:28,787 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:28,809 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:28,869 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:28,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 2 dim-2 vars, End of recursive call: 17 dim-0 vars, and 1 xjuncts. [2018-02-04 12:27:28,939 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 19 variables, input treesize:231, output treesize:431 [2018-02-04 12:27:29,050 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 425 treesize of output 329 [2018-02-04 12:27:29,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:27:29,057 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 370 treesize of output 416 [2018-02-04 12:27:29,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:29,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:29,209 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 229 treesize of output 234 [2018-02-04 12:27:29,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:27:29,215 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 20 treesize of output 16 [2018-02-04 12:27:29,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:29,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:29,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 2 dim-2 vars, End of recursive call: 15 dim-0 vars, and 1 xjuncts. [2018-02-04 12:27:29,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 17 variables, input treesize:452, output treesize:422 [2018-02-04 12:27:29,373 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 429 treesize of output 333 [2018-02-04 12:27:29,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:27:29,379 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 374 treesize of output 418 [2018-02-04 12:27:29,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:29,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:29,526 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 233 treesize of output 238 [2018-02-04 12:27:29,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:27:29,532 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 24 treesize of output 18 [2018-02-04 12:27:29,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:29,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:29,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 2 dim-2 vars, End of recursive call: 15 dim-0 vars, and 1 xjuncts. [2018-02-04 12:27:29,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 17 variables, input treesize:460, output treesize:422 [2018-02-04 12:27:29,932 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 419 treesize of output 293 [2018-02-04 12:27:29,937 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 209 treesize of output 146 [2018-02-04 12:27:29,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:30,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 1 [2018-02-04 12:27:30,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:30,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:30,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 127 [2018-02-04 12:27:30,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 1 [2018-02-04 12:27:30,185 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:30,189 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-02-04 12:27:30,189 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:27:30,190 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:27:30,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:27:30,193 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 19 variables, input treesize:440, output treesize:16 [2018-02-04 12:27:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 78 not checked. [2018-02-04 12:27:30,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:27:30,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2018-02-04 12:27:30,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 12:27:30,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 12:27:30,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1065, Unknown=12, NotChecked=924, Total=2162 [2018-02-04 12:27:30,271 INFO L87 Difference]: Start difference. First operand 241 states and 301 transitions. Second operand 47 states. Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown