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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:03:17,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:03:17,668 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:03:17,683 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:03:17,683 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:03:17,684 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:03:17,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:03:17,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:03:17,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:03:17,689 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:03:17,690 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:03:17,690 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:03:17,691 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:03:17,693 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:03:17,693 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:03:17,696 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:03:17,698 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:03:17,700 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:03:17,701 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:03:17,702 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:03:17,705 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:03:17,705 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:03:17,705 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:03:17,706 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:03:17,707 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:03:17,708 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:03:17,708 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:03:17,709 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:03:17,709 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:03:17,710 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:03:17,710 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:03:17,710 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:03:17,718 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:03:17,719 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:03:17,720 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:03:17,720 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:03:17,720 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:03:17,720 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:03:17,720 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:03:17,721 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:03:17,721 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:03:17,721 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:03:17,721 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:03:17,721 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:03:17,721 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:03:17,721 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:03:17,721 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:03:17,722 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:03:17,722 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:03:17,722 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:03:17,722 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:03:17,722 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:03:17,722 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:03:17,722 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:03:17,723 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:03:17,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:03:17,723 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:03:17,723 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:03:17,723 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:03:17,724 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:03:17,724 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:03:17,724 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:03:17,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:03:17,724 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:03:17,725 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:03:17,725 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:03:17,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:03:17,766 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:03:17,769 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:03:17,771 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:03:17,771 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:03:17,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i [2018-01-29 23:03:17,958 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:03:17,964 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:03:17,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:03:17,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:03:17,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:03:17,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:03:17" (1/1) ... [2018-01-29 23:03:17,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12700a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:03:17, skipping insertion in model container [2018-01-29 23:03:17,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:03:17" (1/1) ... [2018-01-29 23:03:17,986 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:03:18,034 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:03:18,170 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:03:18,200 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:03:18,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:03:18 WrapperNode [2018-01-29 23:03:18,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:03:18,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:03:18,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:03:18,211 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:03:18,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:03:18" (1/1) ... [2018-01-29 23:03:18,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:03:18" (1/1) ... [2018-01-29 23:03:18,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:03:18" (1/1) ... [2018-01-29 23:03:18,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:03:18" (1/1) ... [2018-01-29 23:03:18,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:03:18" (1/1) ... [2018-01-29 23:03:18,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:03:18" (1/1) ... [2018-01-29 23:03:18,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:03:18" (1/1) ... [2018-01-29 23:03:18,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:03:18,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:03:18,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:03:18,259 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:03:18,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:03:18" (1/1) ... No working directory specified, using /storage/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-01-29 23:03:18,310 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:03:18,310 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:03:18,311 INFO L136 BoogieDeclarations]: Found implementation of procedure FFmul [2018-01-29 23:03:18,311 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2018-01-29 23:03:18,311 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2018-01-29 23:03:18,311 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2018-01-29 23:03:18,311 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2018-01-29 23:03:18,311 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2018-01-29 23:03:18,311 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2018-01-29 23:03:18,311 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2018-01-29 23:03:18,311 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:03:18,312 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:03:18,312 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:03:18,312 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:03:18,312 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:03:18,312 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:03:18,312 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:03:18,312 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:03:18,313 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-29 23:03:18,313 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-29 23:03:18,313 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:03:18,313 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-29 23:03:18,313 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-29 23:03:18,313 INFO L128 BoogieDeclarations]: Found specification of procedure FFmul [2018-01-29 23:03:18,314 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2018-01-29 23:03:18,314 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFnew [2018-01-29 23:03:18,314 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFfree [2018-01-29 23:03:18,314 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFswap [2018-01-29 23:03:18,314 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2018-01-29 23:03:18,314 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2018-01-29 23:03:18,315 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2018-01-29 23:03:18,315 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:03:18,315 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:03:18,315 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:03:18,531 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-29 23:03:18,983 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:03:18,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:03:18 BoogieIcfgContainer [2018-01-29 23:03:18,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:03:18,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:03:18,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:03:18,988 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:03:18,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:03:17" (1/3) ... [2018-01-29 23:03:18,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5e7db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:03:18, skipping insertion in model container [2018-01-29 23:03:18,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:03:18" (2/3) ... [2018-01-29 23:03:18,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5e7db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:03:18, skipping insertion in model container [2018-01-29 23:03:18,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:03:18" (3/3) ... [2018-01-29 23:03:18,991 INFO L107 eAbstractionObserver]: Analyzing ICFG 20020406-1_false-valid-memtrack.i [2018-01-29 23:03:18,998 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:03:19,004 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-29 23:03:19,069 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:03:19,070 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:03:19,070 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:03:19,070 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:03:19,070 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:03:19,070 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:03:19,070 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:03:19,070 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:03:19,071 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:03:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2018-01-29 23:03:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-29 23:03:19,105 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:19,106 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:03:19,106 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-01-29 23:03:19,111 INFO L82 PathProgramCache]: Analyzing trace with hash 905890413, now seen corresponding path program 1 times [2018-01-29 23:03:19,113 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:19,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:19,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:19,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:19,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:19,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:19,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:03:19,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:03:19,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:03:19,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:03:19,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:03:19,434 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 4 states. [2018-01-29 23:03:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:19,721 INFO L93 Difference]: Finished difference Result 504 states and 578 transitions. [2018-01-29 23:03:19,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:03:19,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-29 23:03:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:19,736 INFO L225 Difference]: With dead ends: 504 [2018-01-29 23:03:19,736 INFO L226 Difference]: Without dead ends: 283 [2018-01-29 23:03:19,742 INFO L553 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-01-29 23:03:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-01-29 23:03:19,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-01-29 23:03:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-29 23:03:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 319 transitions. [2018-01-29 23:03:19,804 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 319 transitions. Word has length 16 [2018-01-29 23:03:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:19,805 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 319 transitions. [2018-01-29 23:03:19,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:03:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 319 transitions. [2018-01-29 23:03:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-29 23:03:19,806 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:19,806 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:03:19,807 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-01-29 23:03:19,807 INFO L82 PathProgramCache]: Analyzing trace with hash 905890414, now seen corresponding path program 1 times [2018-01-29 23:03:19,807 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:19,807 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:19,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:19,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:19,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:19,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:19,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:03:19,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:03:19,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:03:19,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:03:19,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:03:19,908 INFO L87 Difference]: Start difference. First operand 283 states and 319 transitions. Second operand 4 states. [2018-01-29 23:03:20,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:20,110 INFO L93 Difference]: Finished difference Result 290 states and 331 transitions. [2018-01-29 23:03:20,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:03:20,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-29 23:03:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:20,114 INFO L225 Difference]: With dead ends: 290 [2018-01-29 23:03:20,114 INFO L226 Difference]: Without dead ends: 287 [2018-01-29 23:03:20,115 INFO L553 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-01-29 23:03:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-29 23:03:20,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2018-01-29 23:03:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-01-29 23:03:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 320 transitions. [2018-01-29 23:03:20,140 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 320 transitions. Word has length 16 [2018-01-29 23:03:20,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:20,141 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 320 transitions. [2018-01-29 23:03:20,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:03:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 320 transitions. [2018-01-29 23:03:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 23:03:20,142 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:20,142 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:03:20,142 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-01-29 23:03:20,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2101751103, now seen corresponding path program 1 times [2018-01-29 23:03:20,142 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:20,143 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:20,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:20,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:20,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:20,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:20,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:03:20,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:03:20,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:03:20,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:03:20,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:03:20,261 INFO L87 Difference]: Start difference. First operand 284 states and 320 transitions. Second operand 5 states. [2018-01-29 23:03:20,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:20,430 INFO L93 Difference]: Finished difference Result 287 states and 328 transitions. [2018-01-29 23:03:20,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:03:20,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-29 23:03:20,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:20,433 INFO L225 Difference]: With dead ends: 287 [2018-01-29 23:03:20,433 INFO L226 Difference]: Without dead ends: 283 [2018-01-29 23:03:20,434 INFO L553 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-01-29 23:03:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-01-29 23:03:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 278. [2018-01-29 23:03:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-01-29 23:03:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 314 transitions. [2018-01-29 23:03:20,457 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 314 transitions. Word has length 19 [2018-01-29 23:03:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:20,458 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 314 transitions. [2018-01-29 23:03:20,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:03:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 314 transitions. [2018-01-29 23:03:20,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-29 23:03:20,459 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:20,459 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:03:20,460 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-01-29 23:03:20,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1148179361, now seen corresponding path program 1 times [2018-01-29 23:03:20,460 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:20,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:20,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:20,461 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:20,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:20,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:20,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:03:20,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:03:20,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:03:20,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:03:20,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:03:20,543 INFO L87 Difference]: Start difference. First operand 278 states and 314 transitions. Second operand 5 states. [2018-01-29 23:03:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:20,790 INFO L93 Difference]: Finished difference Result 283 states and 324 transitions. [2018-01-29 23:03:20,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:03:20,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-29 23:03:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:20,793 INFO L225 Difference]: With dead ends: 283 [2018-01-29 23:03:20,793 INFO L226 Difference]: Without dead ends: 282 [2018-01-29 23:03:20,794 INFO L553 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-01-29 23:03:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-01-29 23:03:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 277. [2018-01-29 23:03:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-01-29 23:03:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 313 transitions. [2018-01-29 23:03:20,812 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 313 transitions. Word has length 21 [2018-01-29 23:03:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:20,812 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 313 transitions. [2018-01-29 23:03:20,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:03:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 313 transitions. [2018-01-29 23:03:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-29 23:03:20,813 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:20,813 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:03:20,813 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-01-29 23:03:20,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1148179362, now seen corresponding path program 1 times [2018-01-29 23:03:20,814 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:20,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:20,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:20,815 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:20,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:20,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:20,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:03:20,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:03:20,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:03:20,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:03:20,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:03:20,908 INFO L87 Difference]: Start difference. First operand 277 states and 313 transitions. Second operand 5 states. [2018-01-29 23:03:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:21,206 INFO L93 Difference]: Finished difference Result 282 states and 323 transitions. [2018-01-29 23:03:21,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:03:21,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-29 23:03:21,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:21,211 INFO L225 Difference]: With dead ends: 282 [2018-01-29 23:03:21,211 INFO L226 Difference]: Without dead ends: 281 [2018-01-29 23:03:21,213 INFO L553 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-01-29 23:03:21,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-01-29 23:03:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 276. [2018-01-29 23:03:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-01-29 23:03:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 312 transitions. [2018-01-29 23:03:21,231 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 312 transitions. Word has length 21 [2018-01-29 23:03:21,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:21,231 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 312 transitions. [2018-01-29 23:03:21,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:03:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 312 transitions. [2018-01-29 23:03:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 23:03:21,232 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:21,233 INFO L350 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] [2018-01-29 23:03:21,233 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-01-29 23:03:21,233 INFO L82 PathProgramCache]: Analyzing trace with hash -288622704, now seen corresponding path program 1 times [2018-01-29 23:03:21,233 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:21,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:21,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:21,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:21,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:21,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:21,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:03:21,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:03:21,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:03:21,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:03:21,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:03:21,317 INFO L87 Difference]: Start difference. First operand 276 states and 312 transitions. Second operand 5 states. [2018-01-29 23:03:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:21,464 INFO L93 Difference]: Finished difference Result 556 states and 633 transitions. [2018-01-29 23:03:21,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:03:21,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-29 23:03:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:21,467 INFO L225 Difference]: With dead ends: 556 [2018-01-29 23:03:21,467 INFO L226 Difference]: Without dead ends: 292 [2018-01-29 23:03:21,468 INFO L553 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-01-29 23:03:21,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-01-29 23:03:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2018-01-29 23:03:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-01-29 23:03:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 333 transitions. [2018-01-29 23:03:21,482 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 333 transitions. Word has length 25 [2018-01-29 23:03:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:21,482 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 333 transitions. [2018-01-29 23:03:21,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:03:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 333 transitions. [2018-01-29 23:03:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 23:03:21,483 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:21,483 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:03:21,484 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-01-29 23:03:21,484 INFO L82 PathProgramCache]: Analyzing trace with hash 650450346, now seen corresponding path program 1 times [2018-01-29 23:03:21,484 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:21,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:21,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:21,485 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:21,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:21,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:21,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:03:21,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:03:21,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:03:21,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:03:21,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:03:21,760 INFO L87 Difference]: Start difference. First operand 292 states and 333 transitions. Second operand 8 states. [2018-01-29 23:03:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:22,062 INFO L93 Difference]: Finished difference Result 292 states and 333 transitions. [2018-01-29 23:03:22,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:03:22,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-29 23:03:22,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:22,064 INFO L225 Difference]: With dead ends: 292 [2018-01-29 23:03:22,064 INFO L226 Difference]: Without dead ends: 290 [2018-01-29 23:03:22,065 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:03:22,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-01-29 23:03:22,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2018-01-29 23:03:22,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-01-29 23:03:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 331 transitions. [2018-01-29 23:03:22,078 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 331 transitions. Word has length 37 [2018-01-29 23:03:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:22,079 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 331 transitions. [2018-01-29 23:03:22,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:03:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 331 transitions. [2018-01-29 23:03:22,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 23:03:22,080 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:22,080 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:03:22,081 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-01-29 23:03:22,081 INFO L82 PathProgramCache]: Analyzing trace with hash 650450345, now seen corresponding path program 1 times [2018-01-29 23:03:22,081 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:22,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:22,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:22,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:22,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:22,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:22,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:03:22,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:03:22,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:03:22,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:03:22,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:03:22,199 INFO L87 Difference]: Start difference. First operand 290 states and 331 transitions. Second operand 6 states. [2018-01-29 23:03:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:22,561 INFO L93 Difference]: Finished difference Result 290 states and 331 transitions. [2018-01-29 23:03:22,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:03:22,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-01-29 23:03:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:22,563 INFO L225 Difference]: With dead ends: 290 [2018-01-29 23:03:22,563 INFO L226 Difference]: Without dead ends: 288 [2018-01-29 23:03:22,564 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:03:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-01-29 23:03:22,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-01-29 23:03:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-01-29 23:03:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 329 transitions. [2018-01-29 23:03:22,581 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 329 transitions. Word has length 37 [2018-01-29 23:03:22,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:22,582 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 329 transitions. [2018-01-29 23:03:22,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:03:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 329 transitions. [2018-01-29 23:03:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 23:03:22,583 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:22,583 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:03:22,583 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-01-29 23:03:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1310875750, now seen corresponding path program 1 times [2018-01-29 23:03:22,584 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:22,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:22,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:22,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:22,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:22,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:22,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:03:22,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:03:22,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:03:22,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:03:22,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:03:22,715 INFO L87 Difference]: Start difference. First operand 288 states and 329 transitions. Second operand 7 states. [2018-01-29 23:03:22,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:22,826 INFO L93 Difference]: Finished difference Result 577 states and 664 transitions. [2018-01-29 23:03:22,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:03:22,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-01-29 23:03:22,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:22,829 INFO L225 Difference]: With dead ends: 577 [2018-01-29 23:03:22,829 INFO L226 Difference]: Without dead ends: 301 [2018-01-29 23:03:22,831 INFO L553 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-01-29 23:03:22,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-01-29 23:03:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 298. [2018-01-29 23:03:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-01-29 23:03:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 344 transitions. [2018-01-29 23:03:22,847 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 344 transitions. Word has length 38 [2018-01-29 23:03:22,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:22,848 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 344 transitions. [2018-01-29 23:03:22,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:03:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 344 transitions. [2018-01-29 23:03:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-29 23:03:22,849 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:22,849 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:03:22,849 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-01-29 23:03:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1955500516, now seen corresponding path program 1 times [2018-01-29 23:03:22,850 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:22,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:22,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:22,851 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:22,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:22,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:23,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:03:23,008 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:03:23,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:23,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:03:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:23,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:03:23,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-01-29 23:03:23,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:03:23,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:03:23,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:03:23,218 INFO L87 Difference]: Start difference. First operand 298 states and 344 transitions. Second operand 11 states. [2018-01-29 23:03:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:23,682 INFO L93 Difference]: Finished difference Result 607 states and 704 transitions. [2018-01-29 23:03:23,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:03:23,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-01-29 23:03:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:23,686 INFO L225 Difference]: With dead ends: 607 [2018-01-29 23:03:23,686 INFO L226 Difference]: Without dead ends: 319 [2018-01-29 23:03:23,688 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:03:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-29 23:03:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 302. [2018-01-29 23:03:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-01-29 23:03:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 344 transitions. [2018-01-29 23:03:23,705 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 344 transitions. Word has length 42 [2018-01-29 23:03:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:23,706 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 344 transitions. [2018-01-29 23:03:23,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:03:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 344 transitions. [2018-01-29 23:03:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-29 23:03:23,707 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:23,707 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:03:23,707 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-01-29 23:03:23,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1047123042, now seen corresponding path program 2 times [2018-01-29 23:03:23,708 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:23,708 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:23,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:23,709 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:23,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:23,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:24,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:03:24,065 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:03:24,075 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:03:24,106 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:03:24,127 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:03:24,129 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:03:24,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:03:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:24,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:03:24,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-01-29 23:03:24,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:03:24,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:03:24,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:03:24,234 INFO L87 Difference]: Start difference. First operand 302 states and 344 transitions. Second operand 12 states. [2018-01-29 23:03:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:24,602 INFO L93 Difference]: Finished difference Result 617 states and 706 transitions. [2018-01-29 23:03:24,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:03:24,603 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-01-29 23:03:24,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:24,605 INFO L225 Difference]: With dead ends: 617 [2018-01-29 23:03:24,605 INFO L226 Difference]: Without dead ends: 320 [2018-01-29 23:03:24,608 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:03:24,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-01-29 23:03:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 306. [2018-01-29 23:03:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-01-29 23:03:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 349 transitions. [2018-01-29 23:03:24,629 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 349 transitions. Word has length 46 [2018-01-29 23:03:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:24,630 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 349 transitions. [2018-01-29 23:03:24,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:03:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 349 transitions. [2018-01-29 23:03:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:03:24,631 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:24,631 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-01-29 23:03:24,632 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-01-29 23:03:24,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1271113696, now seen corresponding path program 3 times [2018-01-29 23:03:24,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:24,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:24,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:24,633 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:03:24,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:24,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:24,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:03:24,822 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:03:24,834 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:03:24,862 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:03:24,881 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:03:24,894 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:03:24,948 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:03:24,949 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:03:24,953 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:03:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:25,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:03:25,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-01-29 23:03:25,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:03:25,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:03:25,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:03:25,049 INFO L87 Difference]: Start difference. First operand 306 states and 349 transitions. Second operand 13 states. [2018-01-29 23:03:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:25,387 INFO L93 Difference]: Finished difference Result 627 states and 718 transitions. [2018-01-29 23:03:25,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 23:03:25,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-01-29 23:03:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:25,390 INFO L225 Difference]: With dead ends: 627 [2018-01-29 23:03:25,390 INFO L226 Difference]: Without dead ends: 326 [2018-01-29 23:03:25,392 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:03:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-01-29 23:03:25,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 310. [2018-01-29 23:03:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-01-29 23:03:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 354 transitions. [2018-01-29 23:03:25,407 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 354 transitions. Word has length 50 [2018-01-29 23:03:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:25,407 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 354 transitions. [2018-01-29 23:03:25,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:03:25,408 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 354 transitions. [2018-01-29 23:03:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 23:03:25,408 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:25,409 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-01-29 23:03:25,409 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-01-29 23:03:25,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1460958114, now seen corresponding path program 4 times [2018-01-29 23:03:25,409 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:25,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:25,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:25,410 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:03:25,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:25,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:25,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:03:25,604 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:03:25,618 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:03:25,647 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:03:25,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:03:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:25,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:03:25,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2018-01-29 23:03:25,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:03:25,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:03:25,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:03:25,772 INFO L87 Difference]: Start difference. First operand 310 states and 354 transitions. Second operand 14 states. [2018-01-29 23:03:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:26,235 INFO L93 Difference]: Finished difference Result 637 states and 730 transitions. [2018-01-29 23:03:26,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:03:26,236 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-01-29 23:03:26,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:26,239 INFO L225 Difference]: With dead ends: 637 [2018-01-29 23:03:26,239 INFO L226 Difference]: Without dead ends: 332 [2018-01-29 23:03:26,241 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:03:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-01-29 23:03:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 314. [2018-01-29 23:03:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-01-29 23:03:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 359 transitions. [2018-01-29 23:03:26,258 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 359 transitions. Word has length 54 [2018-01-29 23:03:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:26,258 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 359 transitions. [2018-01-29 23:03:26,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:03:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 359 transitions. [2018-01-29 23:03:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-29 23:03:26,259 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:26,260 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1] [2018-01-29 23:03:26,260 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-01-29 23:03:26,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1368325668, now seen corresponding path program 5 times [2018-01-29 23:03:26,260 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:26,260 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:26,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:26,261 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:03:26,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:26,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:26,462 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:03:26,462 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:03:26,466 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:03:26,476 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:03:26,478 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:03:26,481 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:03:26,489 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:03:26,495 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:03:26,542 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:03:26,546 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:03:26,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:03:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:26,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:03:26,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-01-29 23:03:26,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 23:03:26,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 23:03:26,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:03:26,627 INFO L87 Difference]: Start difference. First operand 314 states and 359 transitions. Second operand 15 states. [2018-01-29 23:03:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:27,321 INFO L93 Difference]: Finished difference Result 647 states and 742 transitions. [2018-01-29 23:03:27,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 23:03:27,321 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-01-29 23:03:27,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:27,323 INFO L225 Difference]: With dead ends: 647 [2018-01-29 23:03:27,323 INFO L226 Difference]: Without dead ends: 338 [2018-01-29 23:03:27,324 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-01-29 23:03:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-01-29 23:03:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 318. [2018-01-29 23:03:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-01-29 23:03:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 364 transitions. [2018-01-29 23:03:27,336 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 364 transitions. Word has length 58 [2018-01-29 23:03:27,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:27,336 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 364 transitions. [2018-01-29 23:03:27,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 23:03:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 364 transitions. [2018-01-29 23:03:27,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-29 23:03:27,337 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:27,337 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1] [2018-01-29 23:03:27,337 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-01-29 23:03:27,337 INFO L82 PathProgramCache]: Analyzing trace with hash 517765030, now seen corresponding path program 6 times [2018-01-29 23:03:27,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:27,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:27,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:27,338 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:03:27,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:27,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:27,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:03:27,724 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:03:27,729 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:03:27,753 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:03:27,773 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:03:27,790 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:03:27,833 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:03:27,984 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:03:28,122 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:03:28,326 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:03:28,328 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:03:28,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:03:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:28,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:03:28,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 16 [2018-01-29 23:03:28,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:03:28,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:03:28,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:03:28,404 INFO L87 Difference]: Start difference. First operand 318 states and 364 transitions. Second operand 16 states. [2018-01-29 23:03:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:28,647 INFO L93 Difference]: Finished difference Result 657 states and 754 transitions. [2018-01-29 23:03:28,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 23:03:28,648 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2018-01-29 23:03:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:28,650 INFO L225 Difference]: With dead ends: 657 [2018-01-29 23:03:28,650 INFO L226 Difference]: Without dead ends: 344 [2018-01-29 23:03:28,652 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:03:28,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-01-29 23:03:28,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 322. [2018-01-29 23:03:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-01-29 23:03:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 369 transitions. [2018-01-29 23:03:28,666 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 369 transitions. Word has length 62 [2018-01-29 23:03:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:28,666 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 369 transitions. [2018-01-29 23:03:28,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:03:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 369 transitions. [2018-01-29 23:03:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-29 23:03:28,667 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:28,667 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1] [2018-01-29 23:03:28,667 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-01-29 23:03:28,668 INFO L82 PathProgramCache]: Analyzing trace with hash 770531368, now seen corresponding path program 7 times [2018-01-29 23:03:28,668 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:28,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:28,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:28,669 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:03:28,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:28,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:28,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:03:28,867 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:03:28,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:28,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:03:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:29,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:03:29,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 17 [2018-01-29 23:03:29,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:03:29,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:03:29,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:03:29,030 INFO L87 Difference]: Start difference. First operand 322 states and 369 transitions. Second operand 17 states. [2018-01-29 23:03:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:29,402 INFO L93 Difference]: Finished difference Result 667 states and 766 transitions. [2018-01-29 23:03:29,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:03:29,403 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-01-29 23:03:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:29,405 INFO L225 Difference]: With dead ends: 667 [2018-01-29 23:03:29,405 INFO L226 Difference]: Without dead ends: 350 [2018-01-29 23:03:29,407 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:03:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-01-29 23:03:29,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 326. [2018-01-29 23:03:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-01-29 23:03:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 374 transitions. [2018-01-29 23:03:29,422 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 374 transitions. Word has length 66 [2018-01-29 23:03:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:29,422 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 374 transitions. [2018-01-29 23:03:29,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:03:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 374 transitions. [2018-01-29 23:03:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-29 23:03:29,423 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:29,423 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1] [2018-01-29 23:03:29,423 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-01-29 23:03:29,424 INFO L82 PathProgramCache]: Analyzing trace with hash 24262570, now seen corresponding path program 8 times [2018-01-29 23:03:29,424 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:29,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:29,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:29,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:29,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:29,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-29 23:03:29,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:03:29,862 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:03:29,870 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:03:29,897 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:03:29,922 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:03:29,926 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:03:29,931 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:03:29,963 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-01-29 23:03:29,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:30,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:30,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:03:30,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:03:30,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:03:30,054 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-01-29 23:03:30,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:30,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:30,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-01-29 23:03:30,103 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-01-29 23:03:30,106 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-01-29 23:03:30,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:30,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:30,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:30,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-29 23:03:30,179 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-01-29 23:03:30,181 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-01-29 23:03:30,182 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:03:30,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:03:30,193 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-01-29 23:03:30,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-29 23:03:31,128 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-01-29 23:03:31,134 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-01-29 23:03:31,148 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-01-29 23:03:31,169 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-01-29 23:03:31,203 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-01-29 23:03:31,253 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-01-29 23:03:31,315 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-01-29 23:03:31,364 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-01-29 23:03:31,408 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-01-29 23:03:31,408 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:31,423 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:31,437 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:31,450 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:31,464 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:31,478 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:31,492 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:31,506 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:31,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:31,551 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-01-29 23:03:31,551 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:104, output treesize:164 [2018-01-29 23:03:31,691 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-01-29 23:03:31,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:03:31,697 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-01-29 23:03:31,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:31,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:31,737 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-01-29 23:03:31,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:165, output treesize:150 [2018-01-29 23:03:31,746 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-01-29 23:03:31,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:03:31,751 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-01-29 23:03:31,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:31,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:31,790 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-01-29 23:03:31,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:169, output treesize:150 [2018-01-29 23:03:32,062 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-01-29 23:03:32,066 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-01-29 23:03:32,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:32,115 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-01-29 23:03:32,115 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:32,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:32,121 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-01-29 23:03:32,122 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:134, output treesize:15 [2018-01-29 23:03:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 105 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:03:32,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:03:32,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 34 [2018-01-29 23:03:32,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-29 23:03:32,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-29 23:03:32,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=835, Unknown=255, NotChecked=0, Total=1190 [2018-01-29 23:03:32,227 INFO L87 Difference]: Start difference. First operand 326 states and 374 transitions. Second operand 35 states. [2018-01-29 23:03:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:42,052 INFO L93 Difference]: Finished difference Result 383 states and 445 transitions. [2018-01-29 23:03:42,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 23:03:42,069 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2018-01-29 23:03:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:42,071 INFO L225 Difference]: With dead ends: 383 [2018-01-29 23:03:42,071 INFO L226 Difference]: Without dead ends: 382 [2018-01-29 23:03:42,073 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=292, Invalid=2621, Unknown=509, NotChecked=0, Total=3422 [2018-01-29 23:03:42,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-01-29 23:03:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 325. [2018-01-29 23:03:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-01-29 23:03:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 373 transitions. [2018-01-29 23:03:42,095 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 373 transitions. Word has length 70 [2018-01-29 23:03:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:42,095 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 373 transitions. [2018-01-29 23:03:42,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-29 23:03:42,096 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 373 transitions. [2018-01-29 23:03:42,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-29 23:03:42,096 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:42,097 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1] [2018-01-29 23:03:42,097 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-01-29 23:03:42,097 INFO L82 PathProgramCache]: Analyzing trace with hash 24262571, now seen corresponding path program 1 times [2018-01-29 23:03:42,097 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:42,097 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:42,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:42,098 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:03:42,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:42,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-29 23:03:42,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:03:42,747 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:03:42,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:42,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:03:42,840 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-01-29 23:03:42,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:42,850 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:03:42,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:03:42,852 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-01-29 23:03:42,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:42,858 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-01-29 23:03:42,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-01-29 23:03:42,890 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-01-29 23:03:42,893 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-01-29 23:03:42,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:42,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:42,906 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-01-29 23:03:42,908 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-01-29 23:03:42,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:42,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:42,916 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-01-29 23:03:42,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:38 [2018-01-29 23:03:42,970 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-01-29 23:03:42,971 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-01-29 23:03:42,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:42,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:42,979 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-01-29 23:03:42,980 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-01-29 23:03:42,980 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:03:42,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:03:42,989 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-01-29 23:03:42,989 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:16 [2018-01-29 23:03:43,026 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 ((|#Ultimate.C_memset_#t~loopctr54| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (and (= (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$.offset|) (= |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))))))) is different from true [2018-01-29 23:03:43,035 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_8 Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_8)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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)))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-01-29 23:03:43,045 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_8)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_9)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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 (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1)))) (= |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_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-01-29 23:03:43,056 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_10 Int) (|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_8)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_9)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_10)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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-01-29 23:03:43,076 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_11 Int) (v_prenex_10 Int) (|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_8)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_9)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_10)) (.cse4 (+ v_prenex_11 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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 (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .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 (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0)))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-01-29 23:03:43,092 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_8)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_9)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_10)) (.cse3 (+ v_prenex_11 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ v_prenex_12 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (and (= (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$.base|) (= (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))) |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-01-29 23:03:43,106 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_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_prenex_10 Int) (|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_8)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_9)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_10)) (.cse4 (+ v_prenex_11 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ v_prenex_12 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_13)) (.cse7 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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 (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$.base| (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))))))) is different from true [2018-01-29 23:03:43,125 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_14 Int) (|#Ultimate.C_memset_#ptr.offset| Int) (|#Ultimate.C_memset_#value| Int) (v_prenex_13 Int) (v_prenex_10 Int) (|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse0 (+ |#Ultimate.C_memset_#ptr.offset| v_prenex_8)) (.cse2 (+ |#Ultimate.C_memset_#ptr.offset| v_prenex_9)) (.cse3 (+ |#Ultimate.C_memset_#ptr.offset| v_prenex_10)) (.cse4 (+ v_prenex_11 |#Ultimate.C_memset_#ptr.offset|)) (.cse5 (+ v_prenex_12 |#Ultimate.C_memset_#ptr.offset|)) (.cse6 (+ |#Ultimate.C_memset_#ptr.offset| v_prenex_13)) (.cse7 (+ v_prenex_14 |#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (and (= |c_#memory_$Pointer$.offset| (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$.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) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0)))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_13 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_13)))) is different from true [2018-01-29 23:03:43,181 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-01-29 23:03:43,188 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-01-29 23:03:43,197 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-01-29 23:03:43,216 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-01-29 23:03:43,269 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-01-29 23:03:43,340 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-01-29 23:03:43,426 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-01-29 23:03:43,544 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-01-29 23:03:43,545 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-01-29 23:03:43,692 INFO L303 Elim1Store]: Index analysis took 144 ms [2018-01-29 23:03:43,693 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-01-29 23:03:43,693 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:43,743 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:43,790 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:43,840 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:43,884 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:43,933 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:43,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,202 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-01-29 23:03:44,207 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-01-29 23:03:44,213 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-01-29 23:03:44,222 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-01-29 23:03:44,254 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-01-29 23:03:44,269 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-01-29 23:03:44,289 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-01-29 23:03:44,316 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-01-29 23:03:44,368 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-01-29 23:03:44,369 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,389 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,408 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,427 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,446 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,465 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,485 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,504 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,525 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,579 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-01-29 23:03:44,579 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 15 variables, input treesize:183, output treesize:303 [2018-01-29 23:03:44,698 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-01-29 23:03:44,721 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:03:44,728 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-01-29 23:03:44,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,850 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-01-29 23:03:44,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:03:44,857 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-01-29 23:03:44,857 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,931 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-01-29 23:03:44,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:324, output treesize:294 [2018-01-29 23:03:44,943 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-01-29 23:03:44,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:03:44,948 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-01-29 23:03:44,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:44,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:45,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 301 treesize of output 237 [2018-01-29 23:03:45,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:03:45,056 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-01-29 23:03:45,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:45,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:45,150 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-01-29 23:03:45,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:332, output treesize:294 [2018-01-29 23:03:45,392 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-01-29 23:03:45,396 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-01-29 23:03:45,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:45,463 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-01-29 23:03:45,463 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:45,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:45,517 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-01-29 23:03:45,547 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-01-29 23:03:45,547 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:45,552 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-01-29 23:03:45,552 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:03:45,553 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:03:45,558 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-01-29 23:03:45,559 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 15 variables, input treesize:312, output treesize:16 [2018-01-29 23:03:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 120 not checked. [2018-01-29 23:03:45,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:03:45,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 35 [2018-01-29 23:03:45,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-29 23:03:45,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-29 23:03:45,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=687, Unknown=8, NotChecked=472, Total=1260 [2018-01-29 23:03:45,655 INFO L87 Difference]: Start difference. First operand 325 states and 373 transitions. Second operand 36 states. [2018-01-29 23:03:51,369 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 166 DAG size of output 148 [2018-01-29 23:03:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:55,319 INFO L93 Difference]: Finished difference Result 363 states and 422 transitions. [2018-01-29 23:03:55,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 23:03:55,319 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-01-29 23:03:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:55,323 INFO L225 Difference]: With dead ends: 363 [2018-01-29 23:03:55,323 INFO L226 Difference]: Without dead ends: 362 [2018-01-29 23:03:55,324 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=328, Invalid=2558, Unknown=116, NotChecked=904, Total=3906 [2018-01-29 23:03:55,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-01-29 23:03:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 324. [2018-01-29 23:03:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-01-29 23:03:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 372 transitions. [2018-01-29 23:03:55,352 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 372 transitions. Word has length 70 [2018-01-29 23:03:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:55,353 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 372 transitions. [2018-01-29 23:03:55,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-29 23:03:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 372 transitions. [2018-01-29 23:03:55,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-01-29 23:03:55,355 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:55,355 INFO L350 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 2, 2, 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, 1, 1, 1] [2018-01-29 23:03:55,355 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-01-29 23:03:55,355 INFO L82 PathProgramCache]: Analyzing trace with hash 585067706, now seen corresponding path program 1 times [2018-01-29 23:03:55,355 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:55,355 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:55,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:55,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:55,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:55,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2018-01-29 23:03:55,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:03:55,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:03:55,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:03:55,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:03:55,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:03:55,466 INFO L87 Difference]: Start difference. First operand 324 states and 372 transitions. Second operand 6 states. [2018-01-29 23:03:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:55,692 INFO L93 Difference]: Finished difference Result 324 states and 372 transitions. [2018-01-29 23:03:55,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:03:55,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-01-29 23:03:55,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:55,693 INFO L225 Difference]: With dead ends: 324 [2018-01-29 23:03:55,694 INFO L226 Difference]: Without dead ends: 322 [2018-01-29 23:03:55,694 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:03:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-01-29 23:03:55,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2018-01-29 23:03:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-01-29 23:03:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 370 transitions. [2018-01-29 23:03:55,709 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 370 transitions. Word has length 130 [2018-01-29 23:03:55,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:55,709 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 370 transitions. [2018-01-29 23:03:55,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:03:55,710 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 370 transitions. [2018-01-29 23:03:55,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-01-29 23:03:55,710 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:55,711 INFO L350 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 2, 2, 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, 1, 1, 1] [2018-01-29 23:03:55,711 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-01-29 23:03:55,711 INFO L82 PathProgramCache]: Analyzing trace with hash 585067707, now seen corresponding path program 1 times [2018-01-29 23:03:55,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:55,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:55,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:55,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:55,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:55,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2018-01-29 23:03:55,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:03:55,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:03:55,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:03:55,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:03:55,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:03:55,877 INFO L87 Difference]: Start difference. First operand 322 states and 370 transitions. Second operand 8 states. [2018-01-29 23:03:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:56,125 INFO L93 Difference]: Finished difference Result 322 states and 370 transitions. [2018-01-29 23:03:56,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:03:56,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 130 [2018-01-29 23:03:56,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:56,160 INFO L225 Difference]: With dead ends: 322 [2018-01-29 23:03:56,160 INFO L226 Difference]: Without dead ends: 320 [2018-01-29 23:03:56,160 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:03:56,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-01-29 23:03:56,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-01-29 23:03:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-01-29 23:03:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 368 transitions. [2018-01-29 23:03:56,187 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 368 transitions. Word has length 130 [2018-01-29 23:03:56,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:56,188 INFO L432 AbstractCegarLoop]: Abstraction has 320 states and 368 transitions. [2018-01-29 23:03:56,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:03:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 368 transitions. [2018-01-29 23:03:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-01-29 23:03:56,190 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:56,190 INFO L350 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 2, 2, 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, 1, 1, 1, 1] [2018-01-29 23:03:56,190 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-01-29 23:03:56,190 INFO L82 PathProgramCache]: Analyzing trace with hash 957229751, now seen corresponding path program 1 times [2018-01-29 23:03:56,190 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:56,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:56,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:56,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:56,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:56,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 290 proven. 120 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-01-29 23:03:56,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:03:56,515 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:03:56,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:56,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:03:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 290 proven. 120 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-01-29 23:03:56,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:03:56,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-29 23:03:56,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 23:03:56,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 23:03:56,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:03:56,704 INFO L87 Difference]: Start difference. First operand 320 states and 368 transitions. Second operand 15 states. [2018-01-29 23:03:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:57,054 INFO L93 Difference]: Finished difference Result 651 states and 760 transitions. [2018-01-29 23:03:57,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 23:03:57,054 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 131 [2018-01-29 23:03:57,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:57,056 INFO L225 Difference]: With dead ends: 651 [2018-01-29 23:03:57,056 INFO L226 Difference]: Without dead ends: 359 [2018-01-29 23:03:57,056 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:03:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-01-29 23:03:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 335. [2018-01-29 23:03:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-01-29 23:03:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 388 transitions. [2018-01-29 23:03:57,075 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 388 transitions. Word has length 131 [2018-01-29 23:03:57,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:57,075 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 388 transitions. [2018-01-29 23:03:57,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 23:03:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 388 transitions. [2018-01-29 23:03:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-01-29 23:03:57,076 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:57,076 INFO L350 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 2, 2, 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, 1, 1, 1, 1] [2018-01-29 23:03:57,076 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-01-29 23:03:57,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1837235257, now seen corresponding path program 2 times [2018-01-29 23:03:57,076 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:57,077 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:57,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:57,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:03:57,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:57,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 323 proven. 153 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-01-29 23:03:57,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:03:57,395 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:03:57,401 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:03:57,427 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:03:57,459 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:03:57,463 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:03:57,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:03:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 323 proven. 153 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-01-29 23:03:57,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:03:57,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-01-29 23:03:57,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:03:57,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:03:57,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:03:57,613 INFO L87 Difference]: Start difference. First operand 335 states and 388 transitions. Second operand 16 states. [2018-01-29 23:03:57,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:03:57,947 INFO L93 Difference]: Finished difference Result 663 states and 775 transitions. [2018-01-29 23:03:57,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:03:57,948 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 135 [2018-01-29 23:03:57,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:03:57,949 INFO L225 Difference]: With dead ends: 663 [2018-01-29 23:03:57,950 INFO L226 Difference]: Without dead ends: 365 [2018-01-29 23:03:57,950 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:03:57,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-01-29 23:03:57,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 341. [2018-01-29 23:03:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-01-29 23:03:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 396 transitions. [2018-01-29 23:03:57,981 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 396 transitions. Word has length 135 [2018-01-29 23:03:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:03:57,981 INFO L432 AbstractCegarLoop]: Abstraction has 341 states and 396 transitions. [2018-01-29 23:03:57,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:03:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 396 transitions. [2018-01-29 23:03:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-01-29 23:03:57,982 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:03:57,983 INFO L350 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 2, 2, 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, 1, 1, 1, 1] [2018-01-29 23:03:57,983 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-01-29 23:03:57,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1194509125, now seen corresponding path program 3 times [2018-01-29 23:03:57,983 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:03:57,983 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:03:57,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:57,984 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:03:57,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:03:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:03:58,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:03:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 356 proven. 190 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-01-29 23:03:58,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:03:58,264 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:03:58,269 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:03:58,291 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:03:58,311 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:03:58,687 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:03:59,251 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:04:00,595 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:04:02,622 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:04:06,925 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:04:13,468 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:04:22,509 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:04:25,583 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:04:37,594 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:04:37,597 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:04:37,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:04:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 356 proven. 190 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-01-29 23:04:37,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:04:37,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-01-29 23:04:37,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:04:37,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:04:37,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:04:37,669 INFO L87 Difference]: Start difference. First operand 341 states and 396 transitions. Second operand 17 states. [2018-01-29 23:04:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:04:37,963 INFO L93 Difference]: Finished difference Result 675 states and 790 transitions. [2018-01-29 23:04:37,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-29 23:04:37,964 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 139 [2018-01-29 23:04:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:04:37,967 INFO L225 Difference]: With dead ends: 675 [2018-01-29 23:04:37,967 INFO L226 Difference]: Without dead ends: 371 [2018-01-29 23:04:37,968 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:04:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-01-29 23:04:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 345. [2018-01-29 23:04:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-01-29 23:04:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 401 transitions. [2018-01-29 23:04:38,001 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 401 transitions. Word has length 139 [2018-01-29 23:04:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:04:38,001 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 401 transitions. [2018-01-29 23:04:38,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:04:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 401 transitions. [2018-01-29 23:04:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-29 23:04:38,003 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:04:38,003 INFO L350 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 2, 2, 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, 1, 1, 1, 1] [2018-01-29 23:04:38,003 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-01-29 23:04:38,003 INFO L82 PathProgramCache]: Analyzing trace with hash -207590339, now seen corresponding path program 4 times [2018-01-29 23:04:38,003 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:04:38,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:04:38,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:04:38,004 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:04:38,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:04:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:04:38,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:04:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 389 proven. 231 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-01-29 23:04:38,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:04:38,338 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:04:38,344 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:04:38,384 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:04:38,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:04:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 389 proven. 231 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-01-29 23:04:38,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:04:38,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-01-29 23:04:38,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 23:04:38,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 23:04:38,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:04:38,453 INFO L87 Difference]: Start difference. First operand 345 states and 401 transitions. Second operand 18 states. [2018-01-29 23:04:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:04:38,771 INFO L93 Difference]: Finished difference Result 685 states and 803 transitions. [2018-01-29 23:04:38,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-29 23:04:38,772 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 143 [2018-01-29 23:04:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:04:38,774 INFO L225 Difference]: With dead ends: 685 [2018-01-29 23:04:38,774 INFO L226 Difference]: Without dead ends: 377 [2018-01-29 23:04:38,775 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=634, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:04:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-01-29 23:04:38,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 349. [2018-01-29 23:04:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-01-29 23:04:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 406 transitions. [2018-01-29 23:04:38,810 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 406 transitions. Word has length 143 [2018-01-29 23:04:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:04:38,810 INFO L432 AbstractCegarLoop]: Abstraction has 349 states and 406 transitions. [2018-01-29 23:04:38,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 23:04:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 406 transitions. [2018-01-29 23:04:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-01-29 23:04:38,811 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:04:38,811 INFO L350 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 2, 2, 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, 1, 1, 1, 1] [2018-01-29 23:04:38,811 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-01-29 23:04:38,811 INFO L82 PathProgramCache]: Analyzing trace with hash 711723711, now seen corresponding path program 5 times [2018-01-29 23:04:38,811 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:04:38,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:04:38,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:04:38,812 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:04:38,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:04:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:04:38,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:04:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 422 proven. 26 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-01-29 23:04:39,571 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:04:39,571 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:04:39,576 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:04:39,590 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:04:39,591 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:04:39,594 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:04:39,597 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:04:39,623 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:04:39,665 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:04:39,715 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:04:40,288 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:04:40,861 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:04:41,363 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:04:44,428 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:04:47,833 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:04:55,742 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:04:55,781 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:04:55,794 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:04:55,842 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-01-29 23:04:55,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:04:55,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:04:55,850 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:04:55,850 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-01-29 23:04:55,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:04:55,855 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-01-29 23:04:55,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-01-29 23:04:55,879 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-01-29 23:04:55,880 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-01-29 23:04:55,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:04:55,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:04:55,891 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-01-29 23:04:55,893 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-01-29 23:04:55,893 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:04:55,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:04:55,901 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-01-29 23:04:55,901 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:38 [2018-01-29 23:04:55,952 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-01-29 23:04:55,954 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-01-29 23:04:55,954 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:04:55,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:04:55,965 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-01-29 23:04:55,967 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-01-29 23:04:55,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:04:55,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:04:55,973 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-01-29 23:04:55,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:16 [2018-01-29 23:04:55,999 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_27 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_27))) (exists ((|#Ultimate.C_memset_#t~loopctr54| Int)) (let ((.cse0 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (and (= (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$.offset|) (= |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))))))) is different from true [2018-01-29 23:04:56,009 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_16 Int) (|#Ultimate.C_memset_#t~loopctr54| Int)) (let ((.cse0 (+ v_prenex_16 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse1 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (and (= |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) .cse1 0))) (= |c_#memory_$Pointer$.offset| (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))))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_27 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_27)))) is different from true [2018-01-29 23:04:56,019 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_16 Int) (v_prenex_17 Int) (|#Ultimate.C_memset_#t~loopctr54| Int)) (let ((.cse0 (+ v_prenex_16 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse1 (+ v_prenex_17 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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))) (= (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))) |c_#memory_$Pointer$.offset|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_27 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_27)))) is different from true [2018-01-29 23:04:56,031 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_27 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_27))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int) (|#Ultimate.C_memset_#t~loopctr54| Int)) (let ((.cse0 (+ v_prenex_16 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse1 (+ v_prenex_17 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ v_prenex_18 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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))) (= |c_#memory_$Pointer$.offset| (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)))))))) is different from true [2018-01-29 23:04:56,042 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_27 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_27))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int) (|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_19 Int)) (let ((.cse0 (+ v_prenex_16 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ v_prenex_17 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ v_prenex_18 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_19)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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 (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 .cse1) .cse2 .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)))) (= |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) .cse2 0) .cse3 0) .cse4 0) .cse5 0))))))) is different from true [2018-01-29 23:04:56,055 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_27 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_27))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int) (|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse0 (+ v_prenex_16 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ v_prenex_17 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ v_prenex_18 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_19)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_20)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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))))))) is different from true [2018-01-29 23:04:56,073 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_27 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_27))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_21 Int) (|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse0 (+ v_prenex_16 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse1 (+ v_prenex_17 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ v_prenex_18 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_19)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_20)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_21)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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-01-29 23:04:56,094 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_27 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_27))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_22 Int) (v_prenex_21 Int) (|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse0 (+ v_prenex_16 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse1 (+ v_prenex_17 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ v_prenex_18 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_19)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_20)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_21)) (.cse6 (+ v_prenex_22 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse7 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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))) (= (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))) |c_#memory_$Pointer$.offset|))))) is different from true [2018-01-29 23:04:56,115 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_27 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_27))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_21 Int) (|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse0 (+ v_prenex_16 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse1 (+ v_prenex_17 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ v_prenex_18 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_19)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_20)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_21)) (.cse6 (+ v_prenex_22 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse7 (+ v_prenex_23 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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-01-29 23:04:56,136 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse0 (+ v_prenex_16 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ v_prenex_17 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ v_prenex_18 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_19)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_20)) (.cse6 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_21)) (.cse7 (+ v_prenex_22 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ v_prenex_23 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse9 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_24)) (.cse10 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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|) (= |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|) .cse0 0) .cse2 0) .cse3 0) .cse4 0) .cse5 0) .cse6 0) .cse7 0) .cse8 0) .cse9 0) .cse10 0)))))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_27 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_27)))) is different from true [2018-01-29 23:04:56,162 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_27 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_27))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse0 (+ v_prenex_16 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse1 (+ v_prenex_17 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ v_prenex_18 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_19)) (.cse4 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_20)) (.cse5 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_21)) (.cse6 (+ v_prenex_22 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse7 (+ v_prenex_23 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ |c_#Ultimate.C_memset_#ptr.offset| v_prenex_24)) (.cse9 (+ v_prenex_25 |c_#Ultimate.C_memset_#ptr.offset|)) (.cse10 (+ |c_#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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 (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))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse11 (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 .cse11) .cse1 .cse11) .cse2 .cse11) .cse3 .cse11) .cse4 .cse11) .cse5 .cse11) .cse6 .cse11) .cse7 .cse11) .cse8 .cse11) .cse9 .cse11) .cse10 .cse11))) |c_#memory_$Pointer$.offset|))))) is different from true [2018-01-29 23:04:56,196 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_16 Int) (v_prenex_26 Int) (v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_25 Int) (|#Ultimate.C_memset_#value| Int) (v_prenex_24 Int) (v_prenex_21 Int) (v_prenex_20 Int) (|#Ultimate.C_memset_#ptr.offset| Int) (|#Ultimate.C_memset_#t~loopctr54| Int) (v_prenex_19 Int)) (let ((.cse0 (+ v_prenex_16 |#Ultimate.C_memset_#ptr.offset|)) (.cse1 (+ v_prenex_17 |#Ultimate.C_memset_#ptr.offset|)) (.cse2 (+ v_prenex_18 |#Ultimate.C_memset_#ptr.offset|)) (.cse3 (+ |#Ultimate.C_memset_#ptr.offset| v_prenex_19)) (.cse4 (+ |#Ultimate.C_memset_#ptr.offset| v_prenex_20)) (.cse5 (+ |#Ultimate.C_memset_#ptr.offset| v_prenex_21)) (.cse6 (+ v_prenex_22 |#Ultimate.C_memset_#ptr.offset|)) (.cse7 (+ v_prenex_23 |#Ultimate.C_memset_#ptr.offset|)) (.cse8 (+ |#Ultimate.C_memset_#ptr.offset| v_prenex_24)) (.cse9 (+ v_prenex_25 |#Ultimate.C_memset_#ptr.offset|)) (.cse10 (+ v_prenex_26 |#Ultimate.C_memset_#ptr.offset|)) (.cse11 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr54|))) (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 (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))) (= (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))) |c_#memory_$Pointer$.offset|)))) (exists ((DUPFFnew_~maxdeg Int) (v_arrayElimCell_27 Int)) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |c_#length| v_arrayElimCell_27)))) is different from true [2018-01-29 23:04:56,291 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 210 treesize of output 204 [2018-01-29 23:04:56,304 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-01-29 23:04:56,347 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-01-29 23:04:56,413 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-01-29 23:04:56,539 INFO L303 Elim1Store]: Index analysis took 125 ms [2018-01-29 23:04:56,540 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-01-29 23:04:56,731 INFO L303 Elim1Store]: Index analysis took 190 ms [2018-01-29 23:04:56,732 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-01-29 23:04:57,012 INFO L303 Elim1Store]: Index analysis took 279 ms [2018-01-29 23:04:57,013 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-01-29 23:04:57,379 INFO L303 Elim1Store]: Index analysis took 364 ms [2018-01-29 23:04:57,380 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-01-29 23:04:57,954 INFO L303 Elim1Store]: Index analysis took 572 ms [2018-01-29 23:04:57,954 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-01-29 23:04:58,665 INFO L303 Elim1Store]: Index analysis took 709 ms [2018-01-29 23:04:58,666 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-01-29 23:04:59,537 INFO L303 Elim1Store]: Index analysis took 869 ms [2018-01-29 23:04:59,538 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-01-29 23:05:00,564 INFO L303 Elim1Store]: Index analysis took 1023 ms [2018-01-29 23:05:00,565 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-01-29 23:05:01,758 INFO L303 Elim1Store]: Index analysis took 1191 ms [2018-01-29 23:05:01,759 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-01-29 23:05:01,759 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-29 23:05:01,979 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:02,209 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:02,436 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:02,645 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:02,885 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:03,114 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:03,323 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:03,607 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:03,843 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:04,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:04,230 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:04,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:04,935 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-01-29 23:05:04,939 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-01-29 23:05:04,979 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-01-29 23:05:04,988 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-01-29 23:05:05,001 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-01-29 23:05:05,130 INFO L303 Elim1Store]: Index analysis took 127 ms [2018-01-29 23:05:05,130 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-01-29 23:05:05,155 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-01-29 23:05:05,366 INFO L303 Elim1Store]: Index analysis took 209 ms [2018-01-29 23:05:05,367 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-01-29 23:05:05,652 INFO L303 Elim1Store]: Index analysis took 282 ms [2018-01-29 23:05:05,652 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-01-29 23:05:05,939 INFO L303 Elim1Store]: Index analysis took 285 ms [2018-01-29 23:05:05,940 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-01-29 23:05:05,997 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-01-29 23:05:06,068 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-01-29 23:05:06,181 INFO L303 Elim1Store]: Index analysis took 109 ms [2018-01-29 23:05:06,181 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-01-29 23:05:06,182 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-29 23:05:06,238 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:06,303 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:06,345 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:06,380 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:06,415 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:06,458 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:06,493 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:06,543 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:06,602 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:06,662 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:06,719 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:06,777 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:06,905 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-01-29 23:05:06,905 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 19 variables, input treesize:231, output treesize:431 [2018-01-29 23:05:07,073 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-01-29 23:05:07,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:05:07,081 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-01-29 23:05:07,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:05:07,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:07,282 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-01-29 23:05:07,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:05:07,290 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-01-29 23:05:07,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:05:07,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:07,414 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-01-29 23:05:07,414 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 17 variables, input treesize:452, output treesize:422 [2018-01-29 23:05:07,429 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-01-29 23:05:07,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:05:07,437 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-01-29 23:05:07,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:05:07,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:07,639 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-01-29 23:05:07,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:05:07,647 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-01-29 23:05:07,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:05:07,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:07,774 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-01-29 23:05:07,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 17 variables, input treesize:460, output treesize:422 [2018-01-29 23:05:08,072 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-01-29 23:05:08,077 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-01-29 23:05:08,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:05:08,225 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-01-29 23:05:08,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:05:08,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:08,315 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-01-29 23:05:08,401 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-01-29 23:05:08,401 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:05:08,405 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-01-29 23:05:08,406 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:05:08,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:05:08,411 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-01-29 23:05:08,411 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 19 variables, input treesize:440, output treesize:16 [2018-01-29 23:05:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 276 not checked. [2018-01-29 23:05:08,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:05:08,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24] total 39 [2018-01-29 23:05:08,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-29 23:05:08,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-29 23:05:08,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=679, Unknown=12, NotChecked=756, Total=1560 [2018-01-29 23:05:08,609 INFO L87 Difference]: Start difference. First operand 349 states and 406 transitions. Second operand 40 states. Received shutdown request... [2018-01-29 23:05:37,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 23:05:37,756 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:05:37,760 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:05:37,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:05:37 BoogieIcfgContainer [2018-01-29 23:05:37,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:05:37,761 INFO L168 Benchmark]: Toolchain (without parser) took 139802.51 ms. Allocated memory was 305.7 MB in the beginning and 802.2 MB in the end (delta: 496.5 MB). Free memory was 264.6 MB in the beginning and 321.6 MB in the end (delta: -57.0 MB). Peak memory consumption was 439.5 MB. Max. memory is 5.3 GB. [2018-01-29 23:05:37,762 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:05:37,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.78 ms. Allocated memory is still 305.7 MB. Free memory was 263.7 MB in the beginning and 250.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-01-29 23:05:37,763 INFO L168 Benchmark]: Boogie Preprocessor took 48.33 ms. Allocated memory is still 305.7 MB. Free memory was 250.5 MB in the beginning and 248.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:05:37,763 INFO L168 Benchmark]: RCFGBuilder took 725.29 ms. Allocated memory is still 305.7 MB. Free memory was 248.4 MB in the beginning and 191.0 MB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 5.3 GB. [2018-01-29 23:05:37,763 INFO L168 Benchmark]: TraceAbstraction took 138775.31 ms. Allocated memory was 305.7 MB in the beginning and 802.2 MB in the end (delta: 496.5 MB). Free memory was 191.0 MB in the beginning and 321.6 MB in the end (delta: -130.7 MB). Peak memory consumption was 365.8 MB. Max. memory is 5.3 GB. [2018-01-29 23:05:37,764 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 245.78 ms. Allocated memory is still 305.7 MB. Free memory was 263.7 MB in the beginning and 250.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.33 ms. Allocated memory is still 305.7 MB. Free memory was 250.5 MB in the beginning and 248.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 725.29 ms. Allocated memory is still 305.7 MB. Free memory was 248.4 MB in the beginning and 191.0 MB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 138775.31 ms. Allocated memory was 305.7 MB in the beginning and 802.2 MB in the end (delta: 496.5 MB). Free memory was 191.0 MB in the beginning and 321.6 MB in the end (delta: -130.7 MB). Peak memory consumption was 365.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 978). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 978). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 981). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 981). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 976). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 976). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 979). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 971). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 971). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (349states) and interpolant automaton (currently 21 states, 40 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 295 locations, 55 error locations. TIMEOUT Result, 138.7s OverallTime, 25 OverallIterations, 20 TraceHistogramMax, 55.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7221 SDtfs, 1544 SDslu, 50262 SDs, 0 SdLazy, 10937 SolverSat, 598 SolverUnsat, 977 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1667 GetRequests, 1182 SyntacticMatches, 11 SemanticMatches, 473 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 2921 ImplicationChecksByTransitivity, 18.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 349 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 57.1s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 2916 NumberOfCodeBlocks, 2877 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 2877 ConstructedInterpolants, 211 QuantifiedInterpolants, 3177046 SizeOfPredicates, 91 NumberOfNonLiveVariables, 3725 ConjunctsInSsa, 287 ConjunctsInUnsatCore, 39 InterpolantComputations, 11 PerfectInterpolantSequences, 6328/8792 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-05-37-771.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-05-37-771.csv Completed graceful shutdown