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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:55:01,058 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:55:01,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:55:01,072 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:55:01,073 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:55:01,073 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:55:01,074 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:55:01,076 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:55:01,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:55:01,078 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:55:01,079 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:55:01,079 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:55:01,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:55:01,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:55:01,082 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:55:01,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:55:01,085 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:55:01,087 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:55:01,088 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:55:01,089 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:55:01,091 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:55:01,091 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:55:01,091 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:55:01,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:55:01,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:55:01,094 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:55:01,094 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:55:01,095 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:55:01,095 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:55:01,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:55:01,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:55:01,096 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:55:01,105 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:55:01,105 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:55:01,106 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:55:01,106 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:55:01,106 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:55:01,106 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:55:01,106 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:55:01,106 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:55:01,106 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:55:01,107 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:55:01,107 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:55:01,107 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:55:01,107 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:55:01,107 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:55:01,107 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:55:01,107 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:55:01,107 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:55:01,107 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:55:01,107 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:55:01,108 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:55:01,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:55:01,108 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:55:01,108 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:55:01,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:55:01,145 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:55:01,148 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:55:01,149 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:55:01,149 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:55:01,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20020406-1_false-valid-memtrack.i [2018-02-02 09:55:01,301 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:55:01,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:55:01,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:55:01,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:55:01,306 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:55:01,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:55:01" (1/1) ... [2018-02-02 09:55:01,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c7c35fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:01, skipping insertion in model container [2018-02-02 09:55:01,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:55:01" (1/1) ... [2018-02-02 09:55:01,319 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:55:01,353 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:55:01,461 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:55:01,486 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:55:01,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:01 WrapperNode [2018-02-02 09:55:01,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:55:01,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:55:01,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:55:01,497 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:55:01,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:01" (1/1) ... [2018-02-02 09:55:01,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:01" (1/1) ... [2018-02-02 09:55:01,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:01" (1/1) ... [2018-02-02 09:55:01,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:01" (1/1) ... [2018-02-02 09:55:01,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:01" (1/1) ... [2018-02-02 09:55:01,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:01" (1/1) ... [2018-02-02 09:55:01,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:01" (1/1) ... [2018-02-02 09:55:01,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:55:01,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:55:01,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:55:01,536 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:55:01,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:01" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:55:01,576 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:55:01,576 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:55:01,576 INFO L136 BoogieDeclarations]: Found implementation of procedure FFmul [2018-02-02 09:55:01,577 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2018-02-02 09:55:01,577 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2018-02-02 09:55:01,577 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2018-02-02 09:55:01,577 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2018-02-02 09:55:01,577 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2018-02-02 09:55:01,577 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2018-02-02 09:55:01,577 INFO L136 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2018-02-02 09:55:01,578 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:55:01,578 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:55:01,578 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:55:01,578 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:55:01,578 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:55:01,578 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:55:01,578 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:55:01,578 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:55:01,578 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 09:55:01,578 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 09:55:01,578 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:55:01,578 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 09:55:01,578 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 09:55:01,578 INFO L128 BoogieDeclarations]: Found specification of procedure FFmul [2018-02-02 09:55:01,579 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2018-02-02 09:55:01,579 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFnew [2018-02-02 09:55:01,579 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFfree [2018-02-02 09:55:01,579 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFswap [2018-02-02 09:55:01,579 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2018-02-02 09:55:01,579 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2018-02-02 09:55:01,579 INFO L128 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2018-02-02 09:55:01,579 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:55:01,579 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:55:01,579 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:55:01,772 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 09:55:02,090 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:55:02,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:55:02 BoogieIcfgContainer [2018-02-02 09:55:02,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:55:02,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:55:02,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:55:02,095 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:55:02,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:55:01" (1/3) ... [2018-02-02 09:55:02,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ece25e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:55:02, skipping insertion in model container [2018-02-02 09:55:02,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:01" (2/3) ... [2018-02-02 09:55:02,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ece25e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:55:02, skipping insertion in model container [2018-02-02 09:55:02,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:55:02" (3/3) ... [2018-02-02 09:55:02,098 INFO L107 eAbstractionObserver]: Analyzing ICFG 20020406-1_false-valid-memtrack.i [2018-02-02 09:55:02,106 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:55:02,113 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-02 09:55:02,140 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:55:02,140 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:55:02,140 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:55:02,140 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:55:02,140 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:55:02,140 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:55:02,140 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:55:02,140 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:55:02,141 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:55:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-02-02 09:55:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:55:02,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:02,162 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:02,162 INFO L371 AbstractCegarLoop]: === Iteration 1 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:02,165 INFO L82 PathProgramCache]: Analyzing trace with hash 167141018, now seen corresponding path program 1 times [2018-02-02 09:55:02,200 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:02,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:02,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:02,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:55:02,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:02,312 INFO L182 omatonBuilderFactory]: Interpolants [213#true, 214#false, 215#(= 1 (select |#valid| |DUPFFnew_#t~malloc1.base|)), 216#(= 1 (select |#valid| DUPFFnew_~ans~0.base))] [2018-02-02 09:55:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:02,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:55:02,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:55:02,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:55:02,395 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-02-02 09:55:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:02,876 INFO L93 Difference]: Finished difference Result 205 states and 241 transitions. [2018-02-02 09:55:02,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:55:02,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 09:55:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:02,888 INFO L225 Difference]: With dead ends: 205 [2018-02-02 09:55:02,888 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 09:55:02,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:55:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 09:55:02,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-02-02 09:55:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-02 09:55:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 238 transitions. [2018-02-02 09:55:02,923 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 238 transitions. Word has length 14 [2018-02-02 09:55:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:02,923 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 238 transitions. [2018-02-02 09:55:02,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:55:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 238 transitions. [2018-02-02 09:55:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:55:02,923 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:02,924 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:02,924 INFO L371 AbstractCegarLoop]: === Iteration 2 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:02,924 INFO L82 PathProgramCache]: Analyzing trace with hash 167141019, now seen corresponding path program 1 times [2018-02-02 09:55:02,925 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:02,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:02,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:02,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:55:02,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:02,990 INFO L182 omatonBuilderFactory]: Interpolants [626#true, 627#false, 628#(and (= 0 |DUPFFnew_#t~malloc1.offset|) (= 12 (select |#length| |DUPFFnew_#t~malloc1.base|))), 629#(and (= DUPFFnew_~ans~0.offset 0) (= (select |#length| DUPFFnew_~ans~0.base) 12))] [2018-02-02 09:55:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:02,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:55:02,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:55:02,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:55:02,993 INFO L87 Difference]: Start difference. First operand 202 states and 238 transitions. Second operand 4 states. [2018-02-02 09:55:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:03,116 INFO L93 Difference]: Finished difference Result 206 states and 247 transitions. [2018-02-02 09:55:03,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:55:03,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 09:55:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:03,118 INFO L225 Difference]: With dead ends: 206 [2018-02-02 09:55:03,118 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 09:55:03,118 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:55:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 09:55:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2018-02-02 09:55:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-02 09:55:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2018-02-02 09:55:03,128 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 14 [2018-02-02 09:55:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:03,128 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2018-02-02 09:55:03,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:55:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2018-02-02 09:55:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:55:03,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:03,128 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:03,129 INFO L371 AbstractCegarLoop]: === Iteration 3 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1430949362, now seen corresponding path program 1 times [2018-02-02 09:55:03,130 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:03,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:03,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:03,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:55:03,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:03,195 INFO L182 omatonBuilderFactory]: Interpolants [1041#true, 1042#false, 1043#(and (= 0 |DUPFFnew_#t~malloc1.offset|) (= 12 (select |#length| |DUPFFnew_#t~malloc1.base|))), 1044#(and (= DUPFFnew_~ans~0.offset 0) (= 12 (select |#length| DUPFFnew_~ans~0.base))), 1045#(and (= (select |#valid| DUPFFnew_~ans~0.base) 1) (= DUPFFnew_~ans~0.offset 0) (= 12 (select |#length| DUPFFnew_~ans~0.base)))] [2018-02-02 09:55:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:03,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:55:03,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:55:03,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:55:03,196 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand 5 states. [2018-02-02 09:55:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:03,328 INFO L93 Difference]: Finished difference Result 202 states and 243 transitions. [2018-02-02 09:55:03,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:55:03,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 09:55:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:03,329 INFO L225 Difference]: With dead ends: 202 [2018-02-02 09:55:03,329 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 09:55:03,330 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:55:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 09:55:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2018-02-02 09:55:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 09:55:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 233 transitions. [2018-02-02 09:55:03,342 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 233 transitions. Word has length 17 [2018-02-02 09:55:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:03,343 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 233 transitions. [2018-02-02 09:55:03,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:55:03,343 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 233 transitions. [2018-02-02 09:55:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:55:03,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:03,343 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:03,343 INFO L371 AbstractCegarLoop]: === Iteration 4 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:03,343 INFO L82 PathProgramCache]: Analyzing trace with hash 752800660, now seen corresponding path program 1 times [2018-02-02 09:55:03,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:03,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:03,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:03,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:55:03,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:03,393 INFO L182 omatonBuilderFactory]: Interpolants [1449#true, 1450#false, 1451#(= 1 (select |#valid| |DUPFFnew_#t~malloc3.base|)), 1452#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))), 1453#(= 1 (select |#valid| |DUPFFnew_#t~mem5.base|))] [2018-02-02 09:55:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:03,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:55:03,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:55:03,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:55:03,394 INFO L87 Difference]: Start difference. First operand 197 states and 233 transitions. Second operand 5 states. [2018-02-02 09:55:03,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:03,759 INFO L93 Difference]: Finished difference Result 201 states and 242 transitions. [2018-02-02 09:55:03,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:55:03,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-02 09:55:03,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:03,762 INFO L225 Difference]: With dead ends: 201 [2018-02-02 09:55:03,762 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 09:55:03,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:55:03,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 09:55:03,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2018-02-02 09:55:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 09:55:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2018-02-02 09:55:03,776 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 19 [2018-02-02 09:55:03,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:03,777 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2018-02-02 09:55:03,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:55:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2018-02-02 09:55:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:55:03,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:03,778 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:03,778 INFO L371 AbstractCegarLoop]: === Iteration 5 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:03,778 INFO L82 PathProgramCache]: Analyzing trace with hash 752800661, now seen corresponding path program 1 times [2018-02-02 09:55:03,779 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:03,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:03,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:03,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:55:03,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:03,874 INFO L182 omatonBuilderFactory]: Interpolants [1857#true, 1858#false, 1859#(and (= 0 |DUPFFnew_#t~malloc3.offset|) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| |DUPFFnew_#t~malloc3.base|))), 1860#(and (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))), 1861#(and (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| |DUPFFnew_#t~mem5.base|)) (= |DUPFFnew_#t~mem5.offset| 0))] [2018-02-02 09:55:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:03,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:55:03,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:55:03,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:55:03,876 INFO L87 Difference]: Start difference. First operand 196 states and 232 transitions. Second operand 5 states. [2018-02-02 09:55:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:04,156 INFO L93 Difference]: Finished difference Result 200 states and 241 transitions. [2018-02-02 09:55:04,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:55:04,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-02 09:55:04,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:04,158 INFO L225 Difference]: With dead ends: 200 [2018-02-02 09:55:04,158 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 09:55:04,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:55:04,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 09:55:04,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 195. [2018-02-02 09:55:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 09:55:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2018-02-02 09:55:04,165 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 19 [2018-02-02 09:55:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:04,166 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2018-02-02 09:55:04,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:55:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2018-02-02 09:55:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:55:04,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:04,167 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:04,171 INFO L371 AbstractCegarLoop]: === Iteration 6 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:04,171 INFO L82 PathProgramCache]: Analyzing trace with hash -439424694, now seen corresponding path program 1 times [2018-02-02 09:55:04,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:04,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:04,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:04,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:55:04,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:04,221 INFO L182 omatonBuilderFactory]: Interpolants [2263#true, 2264#false, 2265#(or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)), 2266#(and (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (not (= DUPFFnew_~maxdeg 1))), 2267#(not (= |DUPFFnew_#in~maxdeg| 1))] [2018-02-02 09:55:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:04,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:55:04,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:55:04,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:55:04,222 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand 5 states. [2018-02-02 09:55:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:04,263 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2018-02-02 09:55:04,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:55:04,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 09:55:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:04,266 INFO L225 Difference]: With dead ends: 210 [2018-02-02 09:55:04,266 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 09:55:04,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:55:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 09:55:04,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-02-02 09:55:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 09:55:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 251 transitions. [2018-02-02 09:55:04,273 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 251 transitions. Word has length 22 [2018-02-02 09:55:04,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:04,273 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 251 transitions. [2018-02-02 09:55:04,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:55:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 251 transitions. [2018-02-02 09:55:04,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:55:04,274 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:04,275 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:04,275 INFO L371 AbstractCegarLoop]: === Iteration 7 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:04,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475983, now seen corresponding path program 1 times [2018-02-02 09:55:04,276 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:04,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:04,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:04,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:55:04,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:04,327 INFO L182 omatonBuilderFactory]: Interpolants [2688#true, 2689#false, 2690#(= (select |#valid| DUPFFnew_~ans~0.base) 1), 2691#(= 1 (select |#valid| |DUPFFnew_#res.base|)), 2692#(= 1 (select |#valid| |main_#t~ret44.base|)), 2693#(= 1 (select |#valid| main_~f~0.base))] [2018-02-02 09:55:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:04,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:55:04,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:55:04,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:55:04,328 INFO L87 Difference]: Start difference. First operand 210 states and 251 transitions. Second operand 6 states. [2018-02-02 09:55:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:04,538 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2018-02-02 09:55:04,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:55:04,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-02 09:55:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:04,552 INFO L225 Difference]: With dead ends: 208 [2018-02-02 09:55:04,552 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 09:55:04,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:55:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 09:55:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-02 09:55:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 09:55:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 249 transitions. [2018-02-02 09:55:04,557 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 249 transitions. Word has length 32 [2018-02-02 09:55:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:04,558 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 249 transitions. [2018-02-02 09:55:04,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:55:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 249 transitions. [2018-02-02 09:55:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:55:04,558 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:04,558 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:04,558 INFO L371 AbstractCegarLoop]: === Iteration 8 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:04,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1616475984, now seen corresponding path program 1 times [2018-02-02 09:55:04,559 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:04,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:04,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:04,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:55:04,651 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:04,652 INFO L182 omatonBuilderFactory]: Interpolants [3112#true, 3113#false, 3114#(= 0 |DUPFFnew_#t~malloc1.offset|), 3115#(= DUPFFnew_~ans~0.offset 0), 3116#(and (= DUPFFnew_~ans~0.offset 0) (<= (+ DUPFFnew_~ans~0.offset 12) (select |#length| DUPFFnew_~ans~0.base))), 3117#(and (= 0 |DUPFFnew_#res.offset|) (<= 12 (select |#length| |DUPFFnew_#res.base|))), 3118#(and (<= 12 (select |#length| |main_#t~ret44.base|)) (= 0 |main_#t~ret44.offset|)), 3119#(and (<= 12 (select |#length| main_~f~0.base)) (= main_~f~0.offset 0))] [2018-02-02 09:55:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:04,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:55:04,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:55:04,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:55:04,652 INFO L87 Difference]: Start difference. First operand 208 states and 249 transitions. Second operand 8 states. [2018-02-02 09:55:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:04,831 INFO L93 Difference]: Finished difference Result 206 states and 247 transitions. [2018-02-02 09:55:04,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:55:04,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-02 09:55:04,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:04,832 INFO L225 Difference]: With dead ends: 206 [2018-02-02 09:55:04,832 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 09:55:04,833 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:55:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 09:55:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-02-02 09:55:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 09:55:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2018-02-02 09:55:04,843 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 32 [2018-02-02 09:55:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:04,843 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2018-02-02 09:55:04,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:55:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2018-02-02 09:55:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 09:55:04,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:04,844 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:04,844 INFO L371 AbstractCegarLoop]: === Iteration 9 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:04,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1428852052, now seen corresponding path program 1 times [2018-02-02 09:55:04,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:04,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:04,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:04,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:55:04,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:04,913 INFO L182 omatonBuilderFactory]: Interpolants [3538#true, 3539#false, 3540#(or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)), 3541#(= |#Ultimate.C_memset_#t~loopctr54| 0), 3542#(<= |#Ultimate.C_memset_#amount| 0), 3543#(and (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (not (= DUPFFnew_~maxdeg 1))), 3544#(not (= |DUPFFnew_#in~maxdeg| 1))] [2018-02-02 09:55:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:04,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:55:04,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:55:04,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:55:04,913 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 7 states. [2018-02-02 09:55:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:04,973 INFO L93 Difference]: Finished difference Result 215 states and 261 transitions. [2018-02-02 09:55:04,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:55:04,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-02 09:55:04,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:04,974 INFO L225 Difference]: With dead ends: 215 [2018-02-02 09:55:04,974 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 09:55:04,975 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:55:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 09:55:04,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-02-02 09:55:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 09:55:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2018-02-02 09:55:04,981 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 33 [2018-02-02 09:55:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:04,982 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2018-02-02 09:55:04,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:55:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2018-02-02 09:55:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:55:04,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:04,983 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:04,983 INFO L371 AbstractCegarLoop]: === Iteration 10 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:04,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1006536674, now seen corresponding path program 1 times [2018-02-02 09:55:04,984 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:05,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:05,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 09:55:05,085 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,085 INFO L182 omatonBuilderFactory]: Interpolants [3984#(not (= |DUPFFnew_#in~maxdeg| 1)), 3977#true, 3978#false, 3979#(or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)), 3980#(= |#Ultimate.C_memset_#t~loopctr54| 0), 3981#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 3982#(<= |#Ultimate.C_memset_#amount| 1), 3983#(and (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (not (= DUPFFnew_~maxdeg 1)))] [2018-02-02 09:55:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:55:05,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:55:05,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:55:05,086 INFO L87 Difference]: Start difference. First operand 215 states and 261 transitions. Second operand 8 states. [2018-02-02 09:55:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:05,176 INFO L93 Difference]: Finished difference Result 224 states and 275 transitions. [2018-02-02 09:55:05,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:55:05,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-02 09:55:05,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:05,178 INFO L225 Difference]: With dead ends: 224 [2018-02-02 09:55:05,178 INFO L226 Difference]: Without dead ends: 224 [2018-02-02 09:55:05,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:55:05,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-02 09:55:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2018-02-02 09:55:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 09:55:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 263 transitions. [2018-02-02 09:55:05,186 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 263 transitions. Word has length 34 [2018-02-02 09:55:05,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:05,186 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 263 transitions. [2018-02-02 09:55:05,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:55:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 263 transitions. [2018-02-02 09:55:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 09:55:05,189 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:05,189 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:05,189 INFO L371 AbstractCegarLoop]: === Iteration 11 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:05,190 INFO L82 PathProgramCache]: Analyzing trace with hash -799661844, now seen corresponding path program 2 times [2018-02-02 09:55:05,191 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:05,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:05,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:55:05,334 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,335 INFO L182 omatonBuilderFactory]: Interpolants [4432#(= |#Ultimate.C_memset_#t~loopctr54| 0), 4433#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 4434#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 4435#(<= |#Ultimate.C_memset_#amount| 2), 4436#(and (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (not (= DUPFFnew_~maxdeg 1))), 4437#(not (= |DUPFFnew_#in~maxdeg| 1)), 4429#true, 4430#false, 4431#(or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))] [2018-02-02 09:55:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:55:05,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:55:05,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:55:05,335 INFO L87 Difference]: Start difference. First operand 216 states and 263 transitions. Second operand 9 states. [2018-02-02 09:55:05,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:05,422 INFO L93 Difference]: Finished difference Result 227 states and 280 transitions. [2018-02-02 09:55:05,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:55:05,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-02 09:55:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:05,424 INFO L225 Difference]: With dead ends: 227 [2018-02-02 09:55:05,424 INFO L226 Difference]: Without dead ends: 227 [2018-02-02 09:55:05,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:55:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-02 09:55:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 217. [2018-02-02 09:55:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 09:55:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 265 transitions. [2018-02-02 09:55:05,431 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 265 transitions. Word has length 35 [2018-02-02 09:55:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:05,431 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 265 transitions. [2018-02-02 09:55:05,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:55:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 265 transitions. [2018-02-02 09:55:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:55:05,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:05,432 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:05,432 INFO L371 AbstractCegarLoop]: === Iteration 12 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1318490590, now seen corresponding path program 3 times [2018-02-02 09:55:05,433 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:05,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:05,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 09:55:05,514 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,514 INFO L182 omatonBuilderFactory]: Interpolants [4896#(and (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (not (= DUPFFnew_~maxdeg 1))), 4897#(not (= |DUPFFnew_#in~maxdeg| 1)), 4888#true, 4889#false, 4890#(or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)), 4891#(= |#Ultimate.C_memset_#t~loopctr54| 0), 4892#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 4893#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 4894#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 4895#(<= |#Ultimate.C_memset_#amount| 3)] [2018-02-02 09:55:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:55:05,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:55:05,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:55:05,515 INFO L87 Difference]: Start difference. First operand 217 states and 265 transitions. Second operand 10 states. [2018-02-02 09:55:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:05,625 INFO L93 Difference]: Finished difference Result 230 states and 285 transitions. [2018-02-02 09:55:05,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:55:05,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-02 09:55:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:05,627 INFO L225 Difference]: With dead ends: 230 [2018-02-02 09:55:05,627 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 09:55:05,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:55:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 09:55:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 218. [2018-02-02 09:55:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 09:55:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 267 transitions. [2018-02-02 09:55:05,633 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 267 transitions. Word has length 36 [2018-02-02 09:55:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:05,634 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 267 transitions. [2018-02-02 09:55:05,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:55:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 267 transitions. [2018-02-02 09:55:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 09:55:05,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:05,634 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:05,634 INFO L371 AbstractCegarLoop]: === Iteration 13 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:05,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1738260692, now seen corresponding path program 4 times [2018-02-02 09:55:05,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:05,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:05,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:55:05,711 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,711 INFO L182 omatonBuilderFactory]: Interpolants [5360#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 5361#(<= |#Ultimate.C_memset_#t~loopctr54| 4), 5362#(<= |#Ultimate.C_memset_#amount| 4), 5363#(and (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (not (= DUPFFnew_~maxdeg 1))), 5364#(not (= |DUPFFnew_#in~maxdeg| 1)), 5354#true, 5355#false, 5356#(or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)), 5357#(= |#Ultimate.C_memset_#t~loopctr54| 0), 5358#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 5359#(<= |#Ultimate.C_memset_#t~loopctr54| 2)] [2018-02-02 09:55:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:55:05,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:55:05,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:55:05,712 INFO L87 Difference]: Start difference. First operand 218 states and 267 transitions. Second operand 11 states. [2018-02-02 09:55:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:05,817 INFO L93 Difference]: Finished difference Result 233 states and 290 transitions. [2018-02-02 09:55:05,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:55:05,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-02-02 09:55:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:05,818 INFO L225 Difference]: With dead ends: 233 [2018-02-02 09:55:05,818 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 09:55:05,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:55:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 09:55:05,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2018-02-02 09:55:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 09:55:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 269 transitions. [2018-02-02 09:55:05,823 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 269 transitions. Word has length 37 [2018-02-02 09:55:05,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:05,823 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 269 transitions. [2018-02-02 09:55:05,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:55:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 269 transitions. [2018-02-02 09:55:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 09:55:05,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:05,824 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:05,824 INFO L371 AbstractCegarLoop]: === Iteration 14 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:05,825 INFO L82 PathProgramCache]: Analyzing trace with hash -2008269922, now seen corresponding path program 5 times [2018-02-02 09:55:05,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:05,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:05,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:55:05,941 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,942 INFO L182 omatonBuilderFactory]: Interpolants [5827#true, 5828#false, 5829#(or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)), 5830#(= |#Ultimate.C_memset_#t~loopctr54| 0), 5831#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 5832#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 5833#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 5834#(<= |#Ultimate.C_memset_#t~loopctr54| 4), 5835#(<= |#Ultimate.C_memset_#t~loopctr54| 5), 5836#(<= |#Ultimate.C_memset_#amount| 5), 5837#(and (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (not (= DUPFFnew_~maxdeg 1))), 5838#(not (= |DUPFFnew_#in~maxdeg| 1))] [2018-02-02 09:55:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:05,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:55:05,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:55:05,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:55:05,942 INFO L87 Difference]: Start difference. First operand 219 states and 269 transitions. Second operand 12 states. [2018-02-02 09:55:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:06,121 INFO L93 Difference]: Finished difference Result 236 states and 295 transitions. [2018-02-02 09:55:06,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:55:06,123 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-02-02 09:55:06,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:06,126 INFO L225 Difference]: With dead ends: 236 [2018-02-02 09:55:06,126 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 09:55:06,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:55:06,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 09:55:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2018-02-02 09:55:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 09:55:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 271 transitions. [2018-02-02 09:55:06,140 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 271 transitions. Word has length 38 [2018-02-02 09:55:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:06,140 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 271 transitions. [2018-02-02 09:55:06,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:55:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 271 transitions. [2018-02-02 09:55:06,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:55:06,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:06,141 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:06,141 INFO L371 AbstractCegarLoop]: === Iteration 15 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:06,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1788621460, now seen corresponding path program 6 times [2018-02-02 09:55:06,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:06,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:06,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:06,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:55:06,407 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:06,408 INFO L182 omatonBuilderFactory]: Interpolants [6307#true, 6308#false, 6309#(or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)), 6310#(= |#Ultimate.C_memset_#t~loopctr54| 0), 6311#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 6312#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 6313#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 6314#(<= |#Ultimate.C_memset_#t~loopctr54| 4), 6315#(<= |#Ultimate.C_memset_#t~loopctr54| 5), 6316#(<= |#Ultimate.C_memset_#t~loopctr54| 6), 6317#(<= |#Ultimate.C_memset_#amount| 6), 6318#(and (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (not (= DUPFFnew_~maxdeg 1))), 6319#(not (= |DUPFFnew_#in~maxdeg| 1))] [2018-02-02 09:55:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:06,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:55:06,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:55:06,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:55:06,408 INFO L87 Difference]: Start difference. First operand 220 states and 271 transitions. Second operand 13 states. [2018-02-02 09:55:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:06,625 INFO L93 Difference]: Finished difference Result 239 states and 300 transitions. [2018-02-02 09:55:06,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:55:06,626 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-02-02 09:55:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:06,627 INFO L225 Difference]: With dead ends: 239 [2018-02-02 09:55:06,627 INFO L226 Difference]: Without dead ends: 239 [2018-02-02 09:55:06,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:55:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-02 09:55:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 221. [2018-02-02 09:55:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 09:55:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 273 transitions. [2018-02-02 09:55:06,635 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 273 transitions. Word has length 39 [2018-02-02 09:55:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:06,635 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 273 transitions. [2018-02-02 09:55:06,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:55:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 273 transitions. [2018-02-02 09:55:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 09:55:06,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:06,636 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:06,636 INFO L371 AbstractCegarLoop]: === Iteration 16 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:06,637 INFO L82 PathProgramCache]: Analyzing trace with hash 725513566, now seen corresponding path program 7 times [2018-02-02 09:55:06,639 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:06,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:06,749 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:06,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:06,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:55:06,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:06,751 INFO L182 omatonBuilderFactory]: Interpolants [6794#true, 6795#false, 6796#(or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)), 6797#(= |#Ultimate.C_memset_#t~loopctr54| 0), 6798#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 6799#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 6800#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 6801#(<= |#Ultimate.C_memset_#t~loopctr54| 4), 6802#(<= |#Ultimate.C_memset_#t~loopctr54| 5), 6803#(<= |#Ultimate.C_memset_#t~loopctr54| 6), 6804#(<= |#Ultimate.C_memset_#t~loopctr54| 7), 6805#(<= |#Ultimate.C_memset_#amount| 7), 6806#(and (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (not (= DUPFFnew_~maxdeg 1))), 6807#(not (= |DUPFFnew_#in~maxdeg| 1))] [2018-02-02 09:55:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:06,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:55:06,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:55:06,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:55:06,752 INFO L87 Difference]: Start difference. First operand 221 states and 273 transitions. Second operand 14 states. [2018-02-02 09:55:06,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:06,987 INFO L93 Difference]: Finished difference Result 242 states and 305 transitions. [2018-02-02 09:55:06,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:55:06,987 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-02-02 09:55:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:06,989 INFO L225 Difference]: With dead ends: 242 [2018-02-02 09:55:06,989 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 09:55:06,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:55:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 09:55:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2018-02-02 09:55:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 09:55:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 275 transitions. [2018-02-02 09:55:06,999 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 275 transitions. Word has length 40 [2018-02-02 09:55:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:06,999 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 275 transitions. [2018-02-02 09:55:07,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:55:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 275 transitions. [2018-02-02 09:55:07,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 09:55:07,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:07,000 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:07,000 INFO L371 AbstractCegarLoop]: === Iteration 17 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:07,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1354288044, now seen corresponding path program 8 times [2018-02-02 09:55:07,001 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:07,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 09:55:07,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:07,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:55:07,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:07,244 INFO L182 omatonBuilderFactory]: Interpolants [7296#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 7297#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|))), 7298#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|))) (= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|))), 7299#(and (= DUPFFnew_~ans~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))))), 7300#(and (= 0 |DUPFFnew_#res.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |DUPFFnew_#res.base|) (+ 0 8))))), 7301#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~ret44.base|) (+ 0 8)))) (= 0 |main_#t~ret44.offset|)), 7302#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~f~0.base) (+ main_~f~0.offset 8)))), 7303#(= 1 (select |#valid| |main_#t~mem45.base|)), 7288#true, 7289#false, 7290#(= 0 |DUPFFnew_#t~malloc1.offset|), 7291#(= DUPFFnew_~ans~0.offset 0), 7292#(and (= (select |#valid| DUPFFnew_~ans~0.base) 1) (= DUPFFnew_~ans~0.offset 0)), 7293#(and (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~malloc3.base|))), 7294#(and (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))))), 7295#(and (= DUPFFnew_~ans~0.offset 0) (= |DUPFFnew_#t~mem5.base| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~mem5.base|)))] [2018-02-02 09:55:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 09:55:07,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:55:07,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:55:07,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:55:07,245 INFO L87 Difference]: Start difference. First operand 222 states and 275 transitions. Second operand 16 states. [2018-02-02 09:55:07,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:07,924 INFO L93 Difference]: Finished difference Result 231 states and 286 transitions. [2018-02-02 09:55:07,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:55:07,924 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-02 09:55:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:07,926 INFO L225 Difference]: With dead ends: 231 [2018-02-02 09:55:07,926 INFO L226 Difference]: Without dead ends: 231 [2018-02-02 09:55:07,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:55:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-02 09:55:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 226. [2018-02-02 09:55:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 09:55:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 279 transitions. [2018-02-02 09:55:07,931 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 279 transitions. Word has length 41 [2018-02-02 09:55:07,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:07,931 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 279 transitions. [2018-02-02 09:55:07,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:55:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 279 transitions. [2018-02-02 09:55:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 09:55:07,932 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:07,932 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:07,932 INFO L371 AbstractCegarLoop]: === Iteration 18 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:07,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1354288045, now seen corresponding path program 1 times [2018-02-02 09:55:07,933 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:07,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 09:55:08,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:08,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 09:55:08,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:08,405 INFO L182 omatonBuilderFactory]: Interpolants [7781#true, 7782#false, 7783#(or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)), 7784#(and (or (= 0 |DUPFFnew_#t~malloc1.offset|) (not (= DUPFFnew_~maxdeg 1))) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 7785#(and (or (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~maxdeg 1))) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 7786#(and (or (and (= (select |#valid| DUPFFnew_~ans~0.base) 1) (= DUPFFnew_~ans~0.offset 0)) (not (= DUPFFnew_~maxdeg 1))) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 7787#(and (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)) (or (and (= DUPFFnew_~ans~0.offset 0) (= 0 |DUPFFnew_#t~malloc3.offset|) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| |DUPFFnew_#t~malloc3.base|)) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~malloc3.base|))) (not (= DUPFFnew_~maxdeg 1)))), 7788#(and (or (and (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (not (= DUPFFnew_~maxdeg 1))) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 7789#(and (or (and (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| |DUPFFnew_#t~mem5.base|)) (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~mem5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (not (= DUPFFnew_~maxdeg 1))) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 7790#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7791#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|)))), 7792#(and (or (and (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= DUPFFnew_~ans~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (not (= DUPFFnew_~maxdeg 1))) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 7793#(or (not (= |DUPFFnew_#in~maxdeg| 1)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= DUPFFnew_~ans~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))))), 7794#(or (not (= |DUPFFnew_#in~maxdeg| 1)) (and (= 0 (select (select |#memory_$Pointer$.offset| |DUPFFnew_#res.base|) (+ 4 4))) (= 0 |DUPFFnew_#res.offset|) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |DUPFFnew_#res.base|) (+ 4 4)))))), 7795#(and (= 0 |main_#t~ret44.offset|) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~ret44.base|) (+ 4 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~ret44.base|) (+ 4 4)))), 7796#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~f~0.base) (+ main_~f~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~f~0.base) (+ main_~f~0.offset 8))) (= main_~f~0.offset 0)), 7797#(and (<= 8 (select |#length| |main_#t~mem45.base|)) (= |main_#t~mem45.offset| 0))] [2018-02-02 09:55:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 09:55:08,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:55:08,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:55:08,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:55:08,406 INFO L87 Difference]: Start difference. First operand 226 states and 279 transitions. Second operand 17 states. [2018-02-02 09:55:09,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:09,419 INFO L93 Difference]: Finished difference Result 230 states and 285 transitions. [2018-02-02 09:55:09,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 09:55:09,419 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-02-02 09:55:09,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:09,421 INFO L225 Difference]: With dead ends: 230 [2018-02-02 09:55:09,421 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 09:55:09,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:55:09,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 09:55:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 225. [2018-02-02 09:55:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 09:55:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 278 transitions. [2018-02-02 09:55:09,427 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 278 transitions. Word has length 41 [2018-02-02 09:55:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:09,427 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 278 transitions. [2018-02-02 09:55:09,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:55:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 278 transitions. [2018-02-02 09:55:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 09:55:09,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:09,428 INFO L351 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:09,428 INFO L371 AbstractCegarLoop]: === Iteration 19 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:09,429 INFO L82 PathProgramCache]: Analyzing trace with hash -184298158, now seen corresponding path program 1 times [2018-02-02 09:55:09,429 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:09,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-02-02 09:55:09,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:09,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:55:09,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:09,469 INFO L182 omatonBuilderFactory]: Interpolants [8281#true, 8282#false, 8283#(<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg), 8284#(<= (+ |DUPFFnew_#in~maxdeg| 1) 0)] [2018-02-02 09:55:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-02-02 09:55:09,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:55:09,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:55:09,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:55:09,470 INFO L87 Difference]: Start difference. First operand 225 states and 278 transitions. Second operand 4 states. [2018-02-02 09:55:09,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:09,505 INFO L93 Difference]: Finished difference Result 225 states and 277 transitions. [2018-02-02 09:55:09,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:55:09,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-02-02 09:55:09,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:09,506 INFO L225 Difference]: With dead ends: 225 [2018-02-02 09:55:09,507 INFO L226 Difference]: Without dead ends: 225 [2018-02-02 09:55:09,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:55:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-02 09:55:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2018-02-02 09:55:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 09:55:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 269 transitions. [2018-02-02 09:55:09,512 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 269 transitions. Word has length 56 [2018-02-02 09:55:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:09,512 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 269 transitions. [2018-02-02 09:55:09,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:55:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 269 transitions. [2018-02-02 09:55:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 09:55:09,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:09,513 INFO L351 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:09,513 INFO L371 AbstractCegarLoop]: === Iteration 20 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1181406167, now seen corresponding path program 1 times [2018-02-02 09:55:09,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:09,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-02-02 09:55:09,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:09,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:55:09,573 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:55:09,573 INFO L182 omatonBuilderFactory]: Interpolants [8736#(= 1 (select |#valid| |DUPFFnew_#res.base|)), 8737#(= 1 (select |#valid| |main_#t~ret48.base|)), 8738#(= 1 (select |#valid| main_~g~0.base)), 8733#true, 8734#false, 8735#(= (select |#valid| DUPFFnew_~ans~0.base) 1)] [2018-02-02 09:55:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-02-02 09:55:09,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:55:09,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:55:09,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:55:09,574 INFO L87 Difference]: Start difference. First operand 220 states and 269 transitions. Second operand 6 states. [2018-02-02 09:55:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:09,744 INFO L93 Difference]: Finished difference Result 218 states and 267 transitions. [2018-02-02 09:55:09,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:55:09,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-02-02 09:55:09,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:09,746 INFO L225 Difference]: With dead ends: 218 [2018-02-02 09:55:09,746 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 09:55:09,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:55:09,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 09:55:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-02 09:55:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 09:55:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 267 transitions. [2018-02-02 09:55:09,752 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 267 transitions. Word has length 66 [2018-02-02 09:55:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:09,752 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 267 transitions. [2018-02-02 09:55:09,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:55:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 267 transitions. [2018-02-02 09:55:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 09:55:09,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:09,753 INFO L351 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:09,753 INFO L371 AbstractCegarLoop]: === Iteration 21 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:09,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1181406168, now seen corresponding path program 1 times [2018-02-02 09:55:09,754 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:09,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-02-02 09:55:09,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:09,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:55:09,851 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:55:09,852 INFO L182 omatonBuilderFactory]: Interpolants [9184#(and (= main_~g~0.offset 0) (<= 12 (select |#length| main_~g~0.base))), 9177#true, 9178#false, 9179#(= 0 |DUPFFnew_#t~malloc1.offset|), 9180#(= DUPFFnew_~ans~0.offset 0), 9181#(and (= DUPFFnew_~ans~0.offset 0) (<= (+ DUPFFnew_~ans~0.offset 12) (select |#length| DUPFFnew_~ans~0.base))), 9182#(and (= 0 |DUPFFnew_#res.offset|) (<= 12 (select |#length| |DUPFFnew_#res.base|))), 9183#(and (<= 12 (select |#length| |main_#t~ret48.base|)) (= 0 |main_#t~ret48.offset|))] [2018-02-02 09:55:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-02-02 09:55:09,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:55:09,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:55:09,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:55:09,853 INFO L87 Difference]: Start difference. First operand 218 states and 267 transitions. Second operand 8 states. [2018-02-02 09:55:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:10,017 INFO L93 Difference]: Finished difference Result 216 states and 265 transitions. [2018-02-02 09:55:10,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:55:10,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2018-02-02 09:55:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:10,019 INFO L225 Difference]: With dead ends: 216 [2018-02-02 09:55:10,019 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 09:55:10,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:55:10,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 09:55:10,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-02 09:55:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 09:55:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 265 transitions. [2018-02-02 09:55:10,025 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 265 transitions. Word has length 66 [2018-02-02 09:55:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:10,025 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 265 transitions. [2018-02-02 09:55:10,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:55:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 265 transitions. [2018-02-02 09:55:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 09:55:10,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:10,026 INFO L351 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:10,026 INFO L371 AbstractCegarLoop]: === Iteration 22 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:10,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2031114448, now seen corresponding path program 1 times [2018-02-02 09:55:10,027 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:10,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:10,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:10,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:55:10,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:55:10,093 INFO L182 omatonBuilderFactory]: Interpolants [9624#true, 9625#false, 9626#(<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg), 9627#(= |#Ultimate.C_memset_#t~loopctr54| 0), 9628#(<= |#Ultimate.C_memset_#amount| 0), 9629#(<= (+ |DUPFFnew_#in~maxdeg| 1) 0)] [2018-02-02 09:55:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:10,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:55:10,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:55:10,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:55:10,094 INFO L87 Difference]: Start difference. First operand 216 states and 265 transitions. Second operand 6 states. [2018-02-02 09:55:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:10,172 INFO L93 Difference]: Finished difference Result 230 states and 282 transitions. [2018-02-02 09:55:10,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:55:10,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-02-02 09:55:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:10,175 INFO L225 Difference]: With dead ends: 230 [2018-02-02 09:55:10,175 INFO L226 Difference]: Without dead ends: 224 [2018-02-02 09:55:10,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:55:10,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-02 09:55:10,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2018-02-02 09:55:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 09:55:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 267 transitions. [2018-02-02 09:55:10,181 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 267 transitions. Word has length 67 [2018-02-02 09:55:10,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:10,181 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 267 transitions. [2018-02-02 09:55:10,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:55:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 267 transitions. [2018-02-02 09:55:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 09:55:10,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:10,182 INFO L351 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:10,183 INFO L371 AbstractCegarLoop]: === Iteration 23 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:10,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1796020590, now seen corresponding path program 2 times [2018-02-02 09:55:10,183 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:10,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:10,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:10,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 09:55:10,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:55:10,263 INFO L182 omatonBuilderFactory]: Interpolants [10083#true, 10084#false, 10085#(<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg), 10086#(= |#Ultimate.C_memset_#t~loopctr54| 0), 10087#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 10088#(<= |#Ultimate.C_memset_#amount| 1), 10089#(<= (+ |DUPFFnew_#in~maxdeg| 1) 0)] [2018-02-02 09:55:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:10,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:55:10,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:55:10,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:55:10,264 INFO L87 Difference]: Start difference. First operand 218 states and 267 transitions. Second operand 7 states. [2018-02-02 09:55:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:10,333 INFO L93 Difference]: Finished difference Result 232 states and 284 transitions. [2018-02-02 09:55:10,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:55:10,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-02-02 09:55:10,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:10,335 INFO L225 Difference]: With dead ends: 232 [2018-02-02 09:55:10,335 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 09:55:10,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:55:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 09:55:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2018-02-02 09:55:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 09:55:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 267 transitions. [2018-02-02 09:55:10,343 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 267 transitions. Word has length 68 [2018-02-02 09:55:10,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:10,343 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 267 transitions. [2018-02-02 09:55:10,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:55:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 267 transitions. [2018-02-02 09:55:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 09:55:10,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:10,344 INFO L351 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:10,345 INFO L371 AbstractCegarLoop]: === Iteration 24 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:10,345 INFO L82 PathProgramCache]: Analyzing trace with hash 178122480, now seen corresponding path program 3 times [2018-02-02 09:55:10,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:10,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:10,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:10,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 09:55:10,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:55:10,429 INFO L182 omatonBuilderFactory]: Interpolants [10547#true, 10548#false, 10549#(<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg), 10550#(= |#Ultimate.C_memset_#t~loopctr54| 0), 10551#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 10552#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 10553#(<= |#Ultimate.C_memset_#amount| 2), 10554#(<= (+ |DUPFFnew_#in~maxdeg| 1) 0)] [2018-02-02 09:55:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:10,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:55:10,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:55:10,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:55:10,431 INFO L87 Difference]: Start difference. First operand 218 states and 267 transitions. Second operand 8 states. [2018-02-02 09:55:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:10,523 INFO L93 Difference]: Finished difference Result 234 states and 286 transitions. [2018-02-02 09:55:10,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:55:10,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-02-02 09:55:10,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:10,524 INFO L225 Difference]: With dead ends: 234 [2018-02-02 09:55:10,525 INFO L226 Difference]: Without dead ends: 228 [2018-02-02 09:55:10,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:55:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-02 09:55:10,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 218. [2018-02-02 09:55:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 09:55:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 267 transitions. [2018-02-02 09:55:10,530 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 267 transitions. Word has length 69 [2018-02-02 09:55:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:10,531 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 267 transitions. [2018-02-02 09:55:10,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:55:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 267 transitions. [2018-02-02 09:55:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 09:55:10,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:10,532 INFO L351 BasicCegarLoop]: trace histogram [11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:10,532 INFO L371 AbstractCegarLoop]: === Iteration 25 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:10,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1562888622, now seen corresponding path program 4 times [2018-02-02 09:55:10,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:10,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:10,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:10,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:55:10,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:55:10,617 INFO L182 omatonBuilderFactory]: Interpolants [11024#(<= (+ |DUPFFnew_#in~maxdeg| 1) 0), 11016#true, 11017#false, 11018#(<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg), 11019#(= |#Ultimate.C_memset_#t~loopctr54| 0), 11020#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 11021#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 11022#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 11023#(<= |#Ultimate.C_memset_#amount| 3)] [2018-02-02 09:55:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:10,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:55:10,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:55:10,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:55:10,618 INFO L87 Difference]: Start difference. First operand 218 states and 267 transitions. Second operand 9 states. [2018-02-02 09:55:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:10,742 INFO L93 Difference]: Finished difference Result 236 states and 288 transitions. [2018-02-02 09:55:10,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:55:10,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-02-02 09:55:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:10,743 INFO L225 Difference]: With dead ends: 236 [2018-02-02 09:55:10,743 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 09:55:10,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:55:10,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 09:55:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 218. [2018-02-02 09:55:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 09:55:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 267 transitions. [2018-02-02 09:55:10,751 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 267 transitions. Word has length 70 [2018-02-02 09:55:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:10,752 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 267 transitions. [2018-02-02 09:55:10,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:55:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 267 transitions. [2018-02-02 09:55:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 09:55:10,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:10,752 INFO L351 BasicCegarLoop]: trace histogram [12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:10,753 INFO L371 AbstractCegarLoop]: === Iteration 26 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:10,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1540966064, now seen corresponding path program 5 times [2018-02-02 09:55:10,753 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:10,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 61 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:10,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:10,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 09:55:10,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:55:10,820 INFO L182 omatonBuilderFactory]: Interpolants [11490#true, 11491#false, 11492#(<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg), 11493#(= |#Ultimate.C_memset_#t~loopctr54| 0), 11494#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 11495#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 11496#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 11497#(<= |#Ultimate.C_memset_#t~loopctr54| 4), 11498#(<= |#Ultimate.C_memset_#amount| 4), 11499#(<= |DUPFFnew_#in~maxdeg| 0)] [2018-02-02 09:55:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 61 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:10,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:55:10,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:55:10,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:55:10,821 INFO L87 Difference]: Start difference. First operand 218 states and 267 transitions. Second operand 10 states. [2018-02-02 09:55:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:10,928 INFO L93 Difference]: Finished difference Result 238 states and 290 transitions. [2018-02-02 09:55:10,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:55:10,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-02-02 09:55:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:10,930 INFO L225 Difference]: With dead ends: 238 [2018-02-02 09:55:10,930 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 09:55:10,930 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:55:10,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 09:55:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 218. [2018-02-02 09:55:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 09:55:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 267 transitions. [2018-02-02 09:55:10,933 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 267 transitions. Word has length 71 [2018-02-02 09:55:10,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:10,934 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 267 transitions. [2018-02-02 09:55:10,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:55:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 267 transitions. [2018-02-02 09:55:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 09:55:10,934 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:10,934 INFO L351 BasicCegarLoop]: trace histogram [13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:10,934 INFO L371 AbstractCegarLoop]: === Iteration 27 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:10,935 INFO L82 PathProgramCache]: Analyzing trace with hash 861366766, now seen corresponding path program 6 times [2018-02-02 09:55:10,935 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:10,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 70 proven. 15 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:11,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:11,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:55:11,005 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:55:11,005 INFO L182 omatonBuilderFactory]: Interpolants [11969#true, 11970#false, 11971#(<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg), 11972#(= |#Ultimate.C_memset_#t~loopctr54| 0), 11973#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 11974#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 11975#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 11976#(<= |#Ultimate.C_memset_#t~loopctr54| 4), 11977#(<= |#Ultimate.C_memset_#t~loopctr54| 5), 11978#(<= |#Ultimate.C_memset_#amount| 5), 11979#(<= |DUPFFnew_#in~maxdeg| 0)] [2018-02-02 09:55:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 70 proven. 15 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:11,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:55:11,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:55:11,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:55:11,006 INFO L87 Difference]: Start difference. First operand 218 states and 267 transitions. Second operand 11 states. [2018-02-02 09:55:11,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:11,185 INFO L93 Difference]: Finished difference Result 240 states and 292 transitions. [2018-02-02 09:55:11,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:55:11,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-02-02 09:55:11,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:11,186 INFO L225 Difference]: With dead ends: 240 [2018-02-02 09:55:11,186 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 09:55:11,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:55:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 09:55:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 218. [2018-02-02 09:55:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 09:55:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 267 transitions. [2018-02-02 09:55:11,190 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 267 transitions. Word has length 72 [2018-02-02 09:55:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:11,190 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 267 transitions. [2018-02-02 09:55:11,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:55:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 267 transitions. [2018-02-02 09:55:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 09:55:11,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:11,191 INFO L351 BasicCegarLoop]: trace histogram [14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:11,191 INFO L371 AbstractCegarLoop]: === Iteration 28 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1268625008, now seen corresponding path program 7 times [2018-02-02 09:55:11,192 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:11,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 79 proven. 21 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:11,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:11,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:55:11,296 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:55:11,296 INFO L182 omatonBuilderFactory]: Interpolants [12464#(<= |DUPFFnew_#in~maxdeg| 0), 12453#true, 12454#false, 12455#(<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg), 12456#(= |#Ultimate.C_memset_#t~loopctr54| 0), 12457#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 12458#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 12459#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 12460#(<= |#Ultimate.C_memset_#t~loopctr54| 4), 12461#(<= |#Ultimate.C_memset_#t~loopctr54| 5), 12462#(<= |#Ultimate.C_memset_#t~loopctr54| 6), 12463#(<= |#Ultimate.C_memset_#amount| 6)] [2018-02-02 09:55:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 79 proven. 21 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:11,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:55:11,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:55:11,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:55:11,297 INFO L87 Difference]: Start difference. First operand 218 states and 267 transitions. Second operand 12 states. [2018-02-02 09:55:11,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:11,437 INFO L93 Difference]: Finished difference Result 242 states and 294 transitions. [2018-02-02 09:55:11,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:55:11,437 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2018-02-02 09:55:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:11,438 INFO L225 Difference]: With dead ends: 242 [2018-02-02 09:55:11,438 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 09:55:11,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:55:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 09:55:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2018-02-02 09:55:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 09:55:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 267 transitions. [2018-02-02 09:55:11,444 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 267 transitions. Word has length 73 [2018-02-02 09:55:11,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:11,444 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 267 transitions. [2018-02-02 09:55:11,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:55:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 267 transitions. [2018-02-02 09:55:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 09:55:11,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:11,445 INFO L351 BasicCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:11,445 INFO L371 AbstractCegarLoop]: === Iteration 29 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1008728622, now seen corresponding path program 8 times [2018-02-02 09:55:11,446 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:11,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 88 proven. 28 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:11,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:11,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:55:11,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:55:11,609 INFO L182 omatonBuilderFactory]: Interpolants [12942#true, 12943#false, 12944#(<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg), 12945#(= |#Ultimate.C_memset_#t~loopctr54| 0), 12946#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 12947#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 12948#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 12949#(<= |#Ultimate.C_memset_#t~loopctr54| 4), 12950#(<= |#Ultimate.C_memset_#t~loopctr54| 5), 12951#(<= |#Ultimate.C_memset_#t~loopctr54| 6), 12952#(<= |#Ultimate.C_memset_#t~loopctr54| 7), 12953#(<= |#Ultimate.C_memset_#amount| 7), 12954#(<= |DUPFFnew_#in~maxdeg| 0)] [2018-02-02 09:55:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 88 proven. 28 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:11,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:55:11,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:55:11,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:55:11,610 INFO L87 Difference]: Start difference. First operand 218 states and 267 transitions. Second operand 13 states. [2018-02-02 09:55:11,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:11,790 INFO L93 Difference]: Finished difference Result 236 states and 284 transitions. [2018-02-02 09:55:11,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 09:55:11,790 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2018-02-02 09:55:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:11,791 INFO L225 Difference]: With dead ends: 236 [2018-02-02 09:55:11,792 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 09:55:11,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:55:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 09:55:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 216. [2018-02-02 09:55:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 09:55:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 264 transitions. [2018-02-02 09:55:11,797 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 264 transitions. Word has length 74 [2018-02-02 09:55:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:11,798 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 264 transitions. [2018-02-02 09:55:11,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:55:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 264 transitions. [2018-02-02 09:55:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 09:55:11,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:11,799 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:11,799 INFO L371 AbstractCegarLoop]: === Iteration 30 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:11,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1541875248, now seen corresponding path program 9 times [2018-02-02 09:55:11,800 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:11,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:11,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:11,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:55:11,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:55:11,935 INFO L182 omatonBuilderFactory]: Interpolants [13426#true, 13427#false, 13428#(<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg), 13429#(= |#Ultimate.C_memset_#t~loopctr54| 0), 13430#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 13431#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 13432#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 13433#(<= |#Ultimate.C_memset_#t~loopctr54| 4), 13434#(<= |#Ultimate.C_memset_#t~loopctr54| 5), 13435#(<= |#Ultimate.C_memset_#t~loopctr54| 6), 13436#(<= |#Ultimate.C_memset_#t~loopctr54| 7), 13437#(<= |#Ultimate.C_memset_#t~loopctr54| 8), 13438#(<= |#Ultimate.C_memset_#amount| 8), 13439#(<= |DUPFFnew_#in~maxdeg| 1)] [2018-02-02 09:55:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 36 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:11,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:55:11,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:55:11,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:55:11,936 INFO L87 Difference]: Start difference. First operand 216 states and 264 transitions. Second operand 14 states. [2018-02-02 09:55:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:12,157 INFO L93 Difference]: Finished difference Result 254 states and 317 transitions. [2018-02-02 09:55:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:55:12,158 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2018-02-02 09:55:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:12,159 INFO L225 Difference]: With dead ends: 254 [2018-02-02 09:55:12,159 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 09:55:12,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:55:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 09:55:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 228. [2018-02-02 09:55:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 09:55:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 281 transitions. [2018-02-02 09:55:12,165 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 281 transitions. Word has length 75 [2018-02-02 09:55:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:12,165 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 281 transitions. [2018-02-02 09:55:12,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:55:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 281 transitions. [2018-02-02 09:55:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 09:55:12,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:12,166 INFO L351 BasicCegarLoop]: trace histogram [17, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:12,166 INFO L371 AbstractCegarLoop]: === Iteration 31 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:12,167 INFO L82 PathProgramCache]: Analyzing trace with hash 889551470, now seen corresponding path program 10 times [2018-02-02 09:55:12,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:12,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 106 proven. 45 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:12,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:12,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:55:12,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:55:12,321 INFO L182 omatonBuilderFactory]: Interpolants [13952#(<= |#Ultimate.C_memset_#t~loopctr54| 6), 13953#(<= |#Ultimate.C_memset_#t~loopctr54| 7), 13954#(<= |#Ultimate.C_memset_#t~loopctr54| 8), 13955#(<= |#Ultimate.C_memset_#t~loopctr54| 9), 13956#(<= |#Ultimate.C_memset_#amount| 9), 13957#(<= |DUPFFnew_#in~maxdeg| 1), 13943#true, 13944#false, 13945#(<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg), 13946#(= |#Ultimate.C_memset_#t~loopctr54| 0), 13947#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 13948#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 13949#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 13950#(<= |#Ultimate.C_memset_#t~loopctr54| 4), 13951#(<= |#Ultimate.C_memset_#t~loopctr54| 5)] [2018-02-02 09:55:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 106 proven. 45 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:12,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:55:12,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:55:12,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:55:12,322 INFO L87 Difference]: Start difference. First operand 228 states and 281 transitions. Second operand 15 states. [2018-02-02 09:55:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:12,521 INFO L93 Difference]: Finished difference Result 257 states and 322 transitions. [2018-02-02 09:55:12,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:55:12,522 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-02-02 09:55:12,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:12,527 INFO L225 Difference]: With dead ends: 257 [2018-02-02 09:55:12,528 INFO L226 Difference]: Without dead ends: 251 [2018-02-02 09:55:12,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:55:12,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-02 09:55:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2018-02-02 09:55:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 09:55:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2018-02-02 09:55:12,536 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 76 [2018-02-02 09:55:12,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:12,537 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2018-02-02 09:55:12,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:55:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2018-02-02 09:55:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 09:55:12,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:12,539 INFO L351 BasicCegarLoop]: trace histogram [18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:12,539 INFO L371 AbstractCegarLoop]: === Iteration 32 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:12,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2142350832, now seen corresponding path program 11 times [2018-02-02 09:55:12,541 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:12,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:12,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:12,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 09:55:12,710 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:55:12,711 INFO L182 omatonBuilderFactory]: Interpolants [14469#true, 14470#false, 14471#(<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg), 14472#(= |#Ultimate.C_memset_#t~loopctr54| 0), 14473#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 14474#(<= |#Ultimate.C_memset_#t~loopctr54| 2), 14475#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 14476#(<= |#Ultimate.C_memset_#t~loopctr54| 4), 14477#(<= |#Ultimate.C_memset_#t~loopctr54| 5), 14478#(<= |#Ultimate.C_memset_#t~loopctr54| 6), 14479#(<= |#Ultimate.C_memset_#t~loopctr54| 7), 14480#(<= |#Ultimate.C_memset_#t~loopctr54| 8), 14481#(<= |#Ultimate.C_memset_#t~loopctr54| 9), 14482#(<= |#Ultimate.C_memset_#t~loopctr54| 10), 14483#(<= |#Ultimate.C_memset_#amount| 10), 14484#(<= |DUPFFnew_#in~maxdeg| 1)] [2018-02-02 09:55:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:12,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:55:12,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:55:12,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:55:12,712 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand 16 states. [2018-02-02 09:55:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:12,963 INFO L93 Difference]: Finished difference Result 260 states and 327 transitions. [2018-02-02 09:55:12,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 09:55:12,963 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2018-02-02 09:55:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:12,965 INFO L225 Difference]: With dead ends: 260 [2018-02-02 09:55:12,965 INFO L226 Difference]: Without dead ends: 254 [2018-02-02 09:55:12,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:55:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-02-02 09:55:12,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2018-02-02 09:55:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-02 09:55:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 288 transitions. [2018-02-02 09:55:12,972 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 288 transitions. Word has length 77 [2018-02-02 09:55:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:12,973 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 288 transitions. [2018-02-02 09:55:12,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:55:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 288 transitions. [2018-02-02 09:55:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 09:55:12,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:12,975 INFO L351 BasicCegarLoop]: trace histogram [19, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:12,975 INFO L371 AbstractCegarLoop]: === Iteration 33 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:12,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1970541906, now seen corresponding path program 12 times [2018-02-02 09:55:12,976 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:12,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 124 proven. 66 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:13,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:13,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 09:55:13,116 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:55:13,116 INFO L182 omatonBuilderFactory]: Interpolants [15008#(<= |#Ultimate.C_memset_#t~loopctr54| 3), 15009#(<= |#Ultimate.C_memset_#t~loopctr54| 4), 15010#(<= |#Ultimate.C_memset_#t~loopctr54| 5), 15011#(<= |#Ultimate.C_memset_#t~loopctr54| 6), 15012#(<= |#Ultimate.C_memset_#t~loopctr54| 7), 15013#(<= |#Ultimate.C_memset_#t~loopctr54| 8), 15014#(<= |#Ultimate.C_memset_#t~loopctr54| 9), 15015#(<= |#Ultimate.C_memset_#t~loopctr54| 10), 15016#(<= |#Ultimate.C_memset_#t~loopctr54| 11), 15017#(<= |#Ultimate.C_memset_#amount| 11), 15018#(<= |DUPFFnew_#in~maxdeg| 1), 15002#true, 15003#false, 15004#(<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg), 15005#(= |#Ultimate.C_memset_#t~loopctr54| 0), 15006#(<= |#Ultimate.C_memset_#t~loopctr54| 1), 15007#(<= |#Ultimate.C_memset_#t~loopctr54| 2)] [2018-02-02 09:55:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 124 proven. 66 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 09:55:13,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:55:13,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:55:13,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:55:13,117 INFO L87 Difference]: Start difference. First operand 232 states and 288 transitions. Second operand 17 states. [2018-02-02 09:55:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:13,282 INFO L93 Difference]: Finished difference Result 263 states and 332 transitions. [2018-02-02 09:55:13,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 09:55:13,283 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 78 [2018-02-02 09:55:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:13,283 INFO L225 Difference]: With dead ends: 263 [2018-02-02 09:55:13,284 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 09:55:13,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=281, Invalid=589, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:55:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 09:55:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2018-02-02 09:55:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 09:55:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 290 transitions. [2018-02-02 09:55:13,290 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 290 transitions. Word has length 78 [2018-02-02 09:55:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:13,290 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 290 transitions. [2018-02-02 09:55:13,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:55:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 290 transitions. [2018-02-02 09:55:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 09:55:13,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:13,291 INFO L351 BasicCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:13,291 INFO L371 AbstractCegarLoop]: === Iteration 34 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:13,291 INFO L82 PathProgramCache]: Analyzing trace with hash -621197904, now seen corresponding path program 13 times [2018-02-02 09:55:13,292 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:13,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 125 proven. 82 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-02 09:55:13,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:13,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 09:55:13,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:13,869 INFO L182 omatonBuilderFactory]: Interpolants [15552#(and (= 0 |DUPFFnew_#t~mem5.offset|) (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~mem5.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))))), 15553#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 15554#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 15555#(or (and (= |#Ultimate.C_memset_#t~loopctr54| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 15556#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= 1 |#Ultimate.C_memset_#t~loopctr54|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|))) (<= |#Ultimate.C_memset_#t~loopctr54| 1))), 15557#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= 2 |#Ultimate.C_memset_#t~loopctr54|) (<= |#Ultimate.C_memset_#t~loopctr54| 2) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|))))), 15558#(or (and (<= 3 |#Ultimate.C_memset_#t~loopctr54|) (<= |#Ultimate.C_memset_#t~loopctr54| 3) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|)))) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 15559#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= 4 |#Ultimate.C_memset_#t~loopctr54|) (<= |#Ultimate.C_memset_#t~loopctr54| 4) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|))))), 15560#(or (and (<= |#Ultimate.C_memset_#t~loopctr54| 5) (<= 5 |#Ultimate.C_memset_#t~loopctr54|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|)))) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 15561#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr54| 6) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|))) (<= 6 |#Ultimate.C_memset_#t~loopctr54|))), 15562#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= 7 |#Ultimate.C_memset_#t~loopctr54|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|))) (<= |#Ultimate.C_memset_#t~loopctr54| 7))), 15563#(or (and (<= |#Ultimate.C_memset_#t~loopctr54| 8) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|))) (<= 8 |#Ultimate.C_memset_#t~loopctr54|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 15564#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|)))), 15565#(and (= DUPFFnew_~ans~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))))), 15566#(and (= 0 |DUPFFnew_#res.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |DUPFFnew_#res.base|) (+ (- 0) 8))))), 15567#(and (= 0 |main_#t~ret48.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~ret48.base|) (+ 4 4))))), 15568#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~g~0.base) (+ main_~g~0.offset 8)))) (= main_~g~0.offset 0)), 15569#(= 1 (select |#valid| |main_#t~mem49.base|)), 15542#true, 15543#false, 15544#(or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)), 15545#(and (= 0 |DUPFFnew_#t~malloc1.offset|) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 15546#(and (= DUPFFnew_~ans~0.offset 0) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 15547#(= DUPFFnew_~ans~0.offset 0), 15548#(= 0 |DUPFFnew_#t~malloc1.offset|), 15549#(and (= (select |#valid| DUPFFnew_~ans~0.base) 1) (= DUPFFnew_~ans~0.offset 0)), 15550#(and (= 1 (select |#valid| |DUPFFnew_#t~malloc3.base|)) (= DUPFFnew_~ans~0.offset 0) (= 0 |DUPFFnew_#t~malloc3.offset|) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~malloc3.base|))), 15551#(and (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))))] [2018-02-02 09:55:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 125 proven. 82 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-02 09:55:13,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 09:55:13,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 09:55:13,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:55:13,869 INFO L87 Difference]: Start difference. First operand 233 states and 290 transitions. Second operand 28 states. [2018-02-02 09:55:15,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:15,765 INFO L93 Difference]: Finished difference Result 254 states and 322 transitions. [2018-02-02 09:55:15,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 09:55:15,766 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-02-02 09:55:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:15,767 INFO L225 Difference]: With dead ends: 254 [2018-02-02 09:55:15,767 INFO L226 Difference]: Without dead ends: 254 [2018-02-02 09:55:15,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:55:15,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-02-02 09:55:15,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2018-02-02 09:55:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-02 09:55:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 289 transitions. [2018-02-02 09:55:15,770 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 289 transitions. Word has length 79 [2018-02-02 09:55:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:15,771 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 289 transitions. [2018-02-02 09:55:15,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 09:55:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 289 transitions. [2018-02-02 09:55:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 09:55:15,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:15,771 INFO L351 BasicCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:15,771 INFO L371 AbstractCegarLoop]: === Iteration 35 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash -621197903, now seen corresponding path program 1 times [2018-02-02 09:55:15,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:15,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 133 proven. 14 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-02-02 09:55:16,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:16,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 09:55:16,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:16,433 INFO L182 omatonBuilderFactory]: Interpolants [16096#(and (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| |DUPFFnew_#t~mem5.base|)) (= DUPFFnew_~ans~0.offset 0) (= |DUPFFnew_#t~mem5.base| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~mem5.base|)) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= 0 (select (select |#memory_$Pointer$.offset| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))), 16097#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16098#(and (or (not (= 12 (select |#length| |#Ultimate.C_memset_#ptr.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16099#(and (or (not (= 12 (select |#length| |#Ultimate.C_memset_#ptr.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|)))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|)))), 16100#(and (or (<= 3 |DUPFFnew_#in~maxdeg|) (<= |DUPFFnew_#in~maxdeg| 1) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))))) (= DUPFFnew_~ans~0.offset 0)), 16101#(and (= 0 |DUPFFnew_#res.offset|) (or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |DUPFFnew_#res.base|) (+ (- 0) 8)))) (= 0 (select (select |#memory_$Pointer$.offset| |DUPFFnew_#res.base|) (+ (- 0) 8)))) (<= 3 |DUPFFnew_#in~maxdeg|) (<= |DUPFFnew_#in~maxdeg| 1))), 16102#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~ret48.base|) (+ 0 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~ret48.base|) (+ 0 8)))) (= 0 |main_#t~ret48.offset|)), 16103#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~g~0.base) (+ main_~g~0.offset 8))) (= main_~g~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~g~0.base) (+ main_~g~0.offset 8))))), 16104#(and (= (select |#length| |main_#t~mem49.base|) 12) (= |main_#t~mem49.offset| 0)), 16081#true, 16082#false, 16083#(or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)), 16084#(and (= 0 |DUPFFnew_#t~malloc1.offset|) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 16085#(and (= DUPFFnew_~ans~0.offset 0) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 16086#(and (= DUPFFnew_~ans~0.offset 0) (or (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| |DUPFFnew_#t~malloc3.base|)) (not (= DUPFFnew_~maxdeg 1))) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 16087#(and (= DUPFFnew_~ans~0.offset 0) (or (= (select |#length| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))) (+ (* 4 DUPFFnew_~maxdeg) 4)) (not (= DUPFFnew_~maxdeg 1))) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 16088#(and (= DUPFFnew_~ans~0.offset 0) (or (= (select |#length| |DUPFFnew_#t~mem5.base|) (+ (* 4 DUPFFnew_~maxdeg) 4)) (not (= DUPFFnew_~maxdeg 1))) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 16089#(= DUPFFnew_~ans~0.offset 0), 16090#(and (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg)), 16091#(and (= 0 |DUPFFnew_#t~malloc1.offset|) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg)), 16092#(and (= DUPFFnew_~ans~0.offset 0) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg)), 16093#(and (= (select |#valid| DUPFFnew_~ans~0.base) 1) (= DUPFFnew_~ans~0.offset 0) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg)), 16094#(and (= DUPFFnew_~ans~0.offset 0) (= 0 |DUPFFnew_#t~malloc3.offset|) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| |DUPFFnew_#t~malloc3.base|)) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~malloc3.base|))), 16095#(and (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= 0 (select (select |#memory_$Pointer$.offset| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))))] [2018-02-02 09:55:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 133 proven. 14 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-02-02 09:55:16,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 09:55:16,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 09:55:16,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:55:16,434 INFO L87 Difference]: Start difference. First operand 232 states and 289 transitions. Second operand 24 states. [2018-02-02 09:55:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:17,523 INFO L93 Difference]: Finished difference Result 247 states and 312 transitions. [2018-02-02 09:55:17,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:55:17,523 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 79 [2018-02-02 09:55:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:17,524 INFO L225 Difference]: With dead ends: 247 [2018-02-02 09:55:17,524 INFO L226 Difference]: Without dead ends: 247 [2018-02-02 09:55:17,524 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=297, Invalid=1109, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 09:55:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-02 09:55:17,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2018-02-02 09:55:17,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 09:55:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 288 transitions. [2018-02-02 09:55:17,527 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 288 transitions. Word has length 79 [2018-02-02 09:55:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:17,527 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 288 transitions. [2018-02-02 09:55:17,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 09:55:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 288 transitions. [2018-02-02 09:55:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 09:55:17,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:17,528 INFO L351 BasicCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:17,528 INFO L371 AbstractCegarLoop]: === Iteration 36 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:17,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1424236394, now seen corresponding path program 1 times [2018-02-02 09:55:17,528 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:17,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-02 09:55:17,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:17,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:55:17,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:55:17,897 INFO L182 omatonBuilderFactory]: Interpolants [16611#true, 16612#false, 16613#(= (select |#valid| DUPFFnew_~ans~0.base) 1), 16614#(= 1 (select |#valid| |DUPFFnew_#res.base|)), 16615#(= 1 (select |#valid| |main_#t~ret44.base|)), 16616#(= 1 (select |#valid| main_~f~0.base)), 16617#(= |#valid| |old(#valid)|), 16618#(= |#valid| (store |old(#valid)| |DUPFFnew_#t~malloc1.base| (select |#valid| |DUPFFnew_#t~malloc1.base|))), 16619#(and (or (= |#valid| |old(#valid)|) (= DUPFFnew_~ans~0.base (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 16620#(and (= 1 (select |#valid| |DUPFFnew_#t~malloc3.base|)) (= (store (store |old(#valid)| |DUPFFnew_#t~malloc3.base| (select |#valid| |DUPFFnew_#t~malloc3.base|)) (@diff (store |old(#valid)| |DUPFFnew_#t~malloc3.base| (select |#valid| |DUPFFnew_#t~malloc3.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |DUPFFnew_#t~malloc3.base| (select |#valid| |DUPFFnew_#t~malloc3.base|)) |#valid|))) |#valid|) (or (= |#valid| (store |old(#valid)| |DUPFFnew_#t~malloc3.base| (select |#valid| |DUPFFnew_#t~malloc3.base|))) (= DUPFFnew_~ans~0.base (@diff (store |old(#valid)| |DUPFFnew_#t~malloc3.base| (select |#valid| |DUPFFnew_#t~malloc3.base|)) |#valid|)))), 16621#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|))), 16622#(= 1 (select |#valid| |DUPFFexgcd_#in~f.base|)), 16623#(= 1 (select |#valid| DUPFFexgcd_~f.base)), 16624#(= 1 (select |#valid| |DUPFFdeg_#in~f.base|)), 16625#(= 1 (select |#valid| DUPFFdeg_~f.base))] [2018-02-02 09:55:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-02 09:55:17,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:55:17,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:55:17,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:55:17,897 INFO L87 Difference]: Start difference. First operand 231 states and 288 transitions. Second operand 15 states. [2018-02-02 09:55:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:19,255 INFO L93 Difference]: Finished difference Result 364 states and 474 transitions. [2018-02-02 09:55:19,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:55:19,255 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2018-02-02 09:55:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:19,257 INFO L225 Difference]: With dead ends: 364 [2018-02-02 09:55:19,257 INFO L226 Difference]: Without dead ends: 364 [2018-02-02 09:55:19,257 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:55:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-02 09:55:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 325. [2018-02-02 09:55:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-02 09:55:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 455 transitions. [2018-02-02 09:55:19,269 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 455 transitions. Word has length 86 [2018-02-02 09:55:19,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:19,270 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 455 transitions. [2018-02-02 09:55:19,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:55:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 455 transitions. [2018-02-02 09:55:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 09:55:19,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:19,270 INFO L351 BasicCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:19,270 INFO L371 AbstractCegarLoop]: === Iteration 37 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:19,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1424236393, now seen corresponding path program 1 times [2018-02-02 09:55:19,271 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:19,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-02 09:55:20,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:20,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 09:55:20,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:55:20,164 INFO L182 omatonBuilderFactory]: Interpolants [17347#true, 17348#false, 17349#(and (= 0 |DUPFFnew_#t~malloc1.offset|) (= 12 (select |#length| |DUPFFnew_#t~malloc1.base|))), 17350#(and (= DUPFFnew_~ans~0.offset 0) (= 12 (select |#length| DUPFFnew_~ans~0.base))), 17351#(and (= (select |#valid| DUPFFnew_~ans~0.base) 1) (= DUPFFnew_~ans~0.offset 0) (= 12 (select |#length| DUPFFnew_~ans~0.base))), 17352#(and (= 0 |DUPFFnew_#res.offset|) (<= 12 (select |#length| |DUPFFnew_#res.base|)) (= (select |#valid| |DUPFFnew_#res.base|) 1)), 17353#(and (<= 12 (select |#length| |main_#t~ret44.base|)) (= 0 |main_#t~ret44.offset|) (= (select |#valid| |main_#t~ret44.base|) 1)), 17354#(and (= 0 main_~f~0.offset) (= (select |#valid| main_~f~0.base) 1) (<= 12 (select |#length| main_~f~0.base))), 17355#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 17356#(and (= |#valid| |old(#valid)|) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= |old(#length)| |#length|)), 17357#(and (= 0 |DUPFFnew_#t~malloc1.offset|) (= 12 (select |#length| |DUPFFnew_#t~malloc1.base|)) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (= 0 (select |old(#valid)| |DUPFFnew_#t~malloc1.base|)) (= |#length| (store |old(#length)| |DUPFFnew_#t~malloc1.base| (select |#length| |DUPFFnew_#t~malloc1.base|))) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg)), 17358#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= 0 DUPFFnew_~ans~0.offset) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (= (select |#length| DUPFFnew_~ans~0.base) 12) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg)), 17359#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= 0 DUPFFnew_~ans~0.offset) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |#valid| DUPFFnew_~ans~0.base) 1) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (= (select |#length| DUPFFnew_~ans~0.base) 12) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg)), 17360#(and (= 0 DUPFFnew_~ans~0.offset) (= (select |#length| |DUPFFnew_#t~malloc3.base|) (+ (* 4 DUPFFnew_~maxdeg) 4)) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (= (select |#length| DUPFFnew_~ans~0.base) 12) (or (= |#length| (store |old(#length)| |DUPFFnew_#t~malloc3.base| (select |#length| |DUPFFnew_#t~malloc3.base|))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| |DUPFFnew_#t~malloc3.base| (select |#length| |DUPFFnew_#t~malloc3.base|)) |#length|)))) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= (store (store |old(#length)| |DUPFFnew_#t~malloc3.base| (select |#length| |DUPFFnew_#t~malloc3.base|)) (@diff (store |old(#length)| |DUPFFnew_#t~malloc3.base| (select |#length| |DUPFFnew_#t~malloc3.base|)) |#length|) (select |#length| (@diff (store |old(#length)| |DUPFFnew_#t~malloc3.base| (select |#length| |DUPFFnew_#t~malloc3.base|)) |#length|))) |#length|)), 17361#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (and (= 0 DUPFFnew_~ans~0.offset) (= (select |#length| (@diff |old(#length)| |#length|)) (+ (* 4 DUPFFnew_~maxdeg) 4)) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (= (select |#length| DUPFFnew_~ans~0.base) 12) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg)) (= |old(#length)| |#length|)) (= |#length| (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (or (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (and (= 0 DUPFFnew_~ans~0.offset) (= (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) (+ (* 4 DUPFFnew_~maxdeg) 4)) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (= (select |#length| DUPFFnew_~ans~0.base) 12) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg)))), 17362#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (and (= 0 DUPFFnew_~ans~0.offset) (= (select |#length| (@diff |old(#length)| |#length|)) (+ (* 4 |DUPFFnew_#in~maxdeg|) 4)) (= (select |#length| DUPFFnew_~ans~0.base) 12))) (= |#length| (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (or (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))) (and (= 0 DUPFFnew_~ans~0.offset) (= (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) (+ (* 4 |DUPFFnew_#in~maxdeg|) 4)) (= (select |#length| DUPFFnew_~ans~0.base) 12)))), 17363#(and (or (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (and (= (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) (+ (* 4 |DUPFFnew_#in~maxdeg|) 4)) (= 0 |DUPFFnew_#res.offset|) (= 12 (select |#length| |DUPFFnew_#res.base|))) (= 0 (select |old(#valid)| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|) (and (= 0 |DUPFFnew_#res.offset|) (= (select |#length| (@diff |old(#length)| |#length|)) (+ (* 4 |DUPFFnew_#in~maxdeg|) 4)) (= 12 (select |#length| |DUPFFnew_#res.base|)))) (= |#length| (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|))))), 17364#(and (= 0 main_~f~0.offset) (<= 12 (select |#length| main_~f~0.base))), 17365#(and (= 0 |DUPFFexgcd_#in~f.offset|) (<= 12 (select |#length| |DUPFFexgcd_#in~f.base|))), 17366#(and (= 0 DUPFFexgcd_~f.offset) (<= 12 (select |#length| DUPFFexgcd_~f.base))), 17367#(and (= 0 |DUPFFdeg_#in~f.offset|) (<= 12 (select |#length| |DUPFFdeg_#in~f.base|))), 17368#(and (= DUPFFdeg_~f.offset 0) (<= 12 (select |#length| DUPFFdeg_~f.base)))] [2018-02-02 09:55:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-02 09:55:20,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:55:20,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:55:20,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:55:20,165 INFO L87 Difference]: Start difference. First operand 325 states and 455 transitions. Second operand 22 states. [2018-02-02 09:55:21,185 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 60 DAG size of output 58 [2018-02-02 09:55:22,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:22,415 INFO L93 Difference]: Finished difference Result 438 states and 604 transitions. [2018-02-02 09:55:22,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 09:55:22,415 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 86 [2018-02-02 09:55:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:22,417 INFO L225 Difference]: With dead ends: 438 [2018-02-02 09:55:22,417 INFO L226 Difference]: Without dead ends: 438 [2018-02-02 09:55:22,417 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=185, Invalid=937, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:55:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-02-02 09:55:22,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 330. [2018-02-02 09:55:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 09:55:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 458 transitions. [2018-02-02 09:55:22,426 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 458 transitions. Word has length 86 [2018-02-02 09:55:22,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:22,426 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 458 transitions. [2018-02-02 09:55:22,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:55:22,426 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 458 transitions. [2018-02-02 09:55:22,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 09:55:22,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:22,427 INFO L351 BasicCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:22,427 INFO L371 AbstractCegarLoop]: === Iteration 38 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:22,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1589944013, now seen corresponding path program 1 times [2018-02-02 09:55:22,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:22,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-02-02 09:55:22,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:22,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:55:22,504 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:55:22,504 INFO L182 omatonBuilderFactory]: Interpolants [18162#true, 18163#false, 18164#(= 1 (select |#valid| main_~g~0.base)), 18165#(= 1 (select |#valid| |DUPFFexgcd_#in~g.base|)), 18166#(= 1 (select |#valid| DUPFFexgcd_~g.base)), 18167#(= 1 (select |#valid| |DUPFFdeg_#in~f.base|)), 18168#(= 1 (select |#valid| DUPFFdeg_~f.base))] [2018-02-02 09:55:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-02-02 09:55:22,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:55:22,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:55:22,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:55:22,505 INFO L87 Difference]: Start difference. First operand 330 states and 458 transitions. Second operand 7 states. [2018-02-02 09:55:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:22,699 INFO L93 Difference]: Finished difference Result 342 states and 467 transitions. [2018-02-02 09:55:22,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:55:22,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-02-02 09:55:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:22,700 INFO L225 Difference]: With dead ends: 342 [2018-02-02 09:55:22,700 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 09:55:22,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:55:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 09:55:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 335. [2018-02-02 09:55:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-02 09:55:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 463 transitions. [2018-02-02 09:55:22,705 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 463 transitions. Word has length 93 [2018-02-02 09:55:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:22,705 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 463 transitions. [2018-02-02 09:55:22,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:55:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 463 transitions. [2018-02-02 09:55:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 09:55:22,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:22,706 INFO L351 BasicCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:22,706 INFO L371 AbstractCegarLoop]: === Iteration 39 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1589944012, now seen corresponding path program 1 times [2018-02-02 09:55:22,706 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:22,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-02-02 09:55:22,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:22,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:55:22,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:55:22,821 INFO L182 omatonBuilderFactory]: Interpolants [18851#true, 18852#false, 18853#(= 0 |DUPFFnew_#t~malloc1.offset|), 18854#(= 0 DUPFFnew_~ans~0.offset), 18855#(= 0 |DUPFFnew_#res.offset|), 18856#(= 0 |main_#t~ret48.offset|), 18857#(= 0 main_~g~0.offset), 18858#(and (<= (+ main_~g~0.offset 12) (select |#length| main_~g~0.base)) (= 0 main_~g~0.offset)), 18859#(and (<= 12 (select |#length| |DUPFFexgcd_#in~g.base|)) (= 0 |DUPFFexgcd_#in~g.offset|)), 18860#(and (<= 12 (select |#length| DUPFFexgcd_~g.base)) (= 0 DUPFFexgcd_~g.offset)), 18861#(and (= 0 |DUPFFdeg_#in~f.offset|) (<= 12 (select |#length| |DUPFFdeg_#in~f.base|))), 18862#(and (= DUPFFdeg_~f.offset 0) (<= 12 (select |#length| DUPFFdeg_~f.base)))] [2018-02-02 09:55:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-02-02 09:55:22,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:55:22,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:55:22,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:55:22,822 INFO L87 Difference]: Start difference. First operand 335 states and 463 transitions. Second operand 12 states. [2018-02-02 09:55:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:22,996 INFO L93 Difference]: Finished difference Result 346 states and 470 transitions. [2018-02-02 09:55:23,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:55:23,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-02-02 09:55:23,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:23,022 INFO L225 Difference]: With dead ends: 346 [2018-02-02 09:55:23,022 INFO L226 Difference]: Without dead ends: 346 [2018-02-02 09:55:23,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:55:23,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-02 09:55:23,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 335. [2018-02-02 09:55:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-02 09:55:23,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-02-02 09:55:23,029 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 462 transitions. Word has length 93 [2018-02-02 09:55:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:23,029 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-02-02 09:55:23,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:55:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 462 transitions. [2018-02-02 09:55:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 09:55:23,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:23,030 INFO L351 BasicCegarLoop]: trace histogram [20, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:23,030 INFO L371 AbstractCegarLoop]: === Iteration 40 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:23,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1788460660, now seen corresponding path program 1 times [2018-02-02 09:55:23,031 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:23,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-02-02 09:55:23,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:23,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 09:55:23,140 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:55:23,140 INFO L182 omatonBuilderFactory]: Interpolants [19553#true, 19554#false, 19555#(= 1 (select |#valid| main_~g~0.base)), 19556#(= 1 (select |#valid| |DUPFFexgcd_#in~g.base|)), 19557#(= 1 (select |#valid| DUPFFexgcd_~g.base)), 19558#(= 1 (select |#valid| |DUPFFexgcd_#in~f.base|)), 19559#(= 1 (select |#valid| DUPFFexgcd_~f.base)), 19560#(= 1 (select |#valid| |DUPFFdeg_#in~f.base|)), 19561#(= 1 (select |#valid| DUPFFdeg_~f.base))] [2018-02-02 09:55:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-02-02 09:55:23,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:55:23,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:55:23,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:55:23,141 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 9 states. [2018-02-02 09:55:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:23,516 INFO L93 Difference]: Finished difference Result 393 states and 538 transitions. [2018-02-02 09:55:23,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:55:23,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2018-02-02 09:55:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:23,518 INFO L225 Difference]: With dead ends: 393 [2018-02-02 09:55:23,518 INFO L226 Difference]: Without dead ends: 393 [2018-02-02 09:55:23,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:55:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-02-02 09:55:23,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 375. [2018-02-02 09:55:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-02 09:55:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 519 transitions. [2018-02-02 09:55:23,524 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 519 transitions. Word has length 103 [2018-02-02 09:55:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:23,525 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 519 transitions. [2018-02-02 09:55:23,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:55:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 519 transitions. [2018-02-02 09:55:23,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 09:55:23,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:23,526 INFO L351 BasicCegarLoop]: trace histogram [20, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:23,526 INFO L371 AbstractCegarLoop]: === Iteration 41 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:23,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1788460659, now seen corresponding path program 1 times [2018-02-02 09:55:23,527 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:23,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-02 09:55:23,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:23,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:55:23,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:55:23,698 INFO L182 omatonBuilderFactory]: Interpolants [20352#(and (= DUPFFdeg_~f.offset 0) (<= 12 (select |#length| DUPFFdeg_~f.base))), 20339#true, 20340#false, 20341#(= 0 |DUPFFnew_#t~malloc1.offset|), 20342#(= 0 DUPFFnew_~ans~0.offset), 20343#(= 0 |DUPFFnew_#res.offset|), 20344#(= 0 |main_#t~ret48.offset|), 20345#(= 0 main_~g~0.offset), 20346#(and (<= (+ main_~g~0.offset 12) (select |#length| main_~g~0.base)) (= 0 main_~g~0.offset)), 20347#(and (<= 12 (select |#length| |DUPFFexgcd_#in~g.base|)) (= 0 |DUPFFexgcd_#in~g.offset|)), 20348#(and (<= 12 (select |#length| DUPFFexgcd_~g.base)) (= 0 DUPFFexgcd_~g.offset)), 20349#(and (= 0 |DUPFFexgcd_#in~f.offset|) (<= 12 (select |#length| |DUPFFexgcd_#in~f.base|))), 20350#(and (= 0 DUPFFexgcd_~f.offset) (<= 12 (select |#length| DUPFFexgcd_~f.base))), 20351#(and (= 0 |DUPFFdeg_#in~f.offset|) (<= 12 (select |#length| |DUPFFdeg_#in~f.base|)))] [2018-02-02 09:55:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-02 09:55:23,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:55:23,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:55:23,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:55:23,699 INFO L87 Difference]: Start difference. First operand 375 states and 519 transitions. Second operand 14 states. [2018-02-02 09:55:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:24,133 INFO L93 Difference]: Finished difference Result 401 states and 544 transitions. [2018-02-02 09:55:24,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:55:24,133 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-02-02 09:55:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:24,134 INFO L225 Difference]: With dead ends: 401 [2018-02-02 09:55:24,134 INFO L226 Difference]: Without dead ends: 401 [2018-02-02 09:55:24,134 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:55:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-02 09:55:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 380. [2018-02-02 09:55:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-02 09:55:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 521 transitions. [2018-02-02 09:55:24,139 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 521 transitions. Word has length 103 [2018-02-02 09:55:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:24,139 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 521 transitions. [2018-02-02 09:55:24,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:55:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 521 transitions. [2018-02-02 09:55:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 09:55:24,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:24,140 INFO L351 BasicCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2018-02-02 09:55:24,140 INFO L371 AbstractCegarLoop]: === Iteration 42 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1293541507, now seen corresponding path program 2 times [2018-02-02 09:55:24,141 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:24,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-02-02 09:55:24,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:24,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 09:55:24,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:55:24,201 INFO L182 omatonBuilderFactory]: Interpolants [21152#(= 1 (select |#valid| DUPFFdeg_~f.base)), 21145#true, 21146#false, 21147#(= DUPFFdeg_~f.base |DUPFFdeg_#in~f.base|), 21148#(= 1 (select |#valid| |DUPFFdeg_#in~f.base|)), 21149#(= 1 (select |#valid| DUPFFexgcd_~f.base)), 21150#(= 1 (select |#valid| |DUPFFexgcd_#in~g.base|)), 21151#(= 1 (select |#valid| DUPFFexgcd_~g.base))] [2018-02-02 09:55:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-02-02 09:55:24,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:55:24,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:55:24,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:55:24,201 INFO L87 Difference]: Start difference. First operand 380 states and 521 transitions. Second operand 8 states. [2018-02-02 09:55:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:24,471 INFO L93 Difference]: Finished difference Result 395 states and 534 transitions. [2018-02-02 09:55:24,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:55:24,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2018-02-02 09:55:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:24,473 INFO L225 Difference]: With dead ends: 395 [2018-02-02 09:55:24,473 INFO L226 Difference]: Without dead ends: 395 [2018-02-02 09:55:24,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:55:24,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-02 09:55:24,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 381. [2018-02-02 09:55:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-02 09:55:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 523 transitions. [2018-02-02 09:55:24,479 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 523 transitions. Word has length 110 [2018-02-02 09:55:24,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:24,479 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 523 transitions. [2018-02-02 09:55:24,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:55:24,479 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 523 transitions. [2018-02-02 09:55:24,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 09:55:24,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:24,479 INFO L351 BasicCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2018-02-02 09:55:24,480 INFO L371 AbstractCegarLoop]: === Iteration 43 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:24,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1293541506, now seen corresponding path program 2 times [2018-02-02 09:55:24,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:24,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-02-02 09:55:24,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:24,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:55:24,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:55:24,678 INFO L182 omatonBuilderFactory]: Interpolants [21952#(and (= 0 |DUPFFdeg_#in~f.offset|) (<= 8 (select |#length| |DUPFFdeg_#in~f.base|))), 21953#(and (= DUPFFdeg_~f.offset 0) (<= 8 (select |#length| DUPFFdeg_~f.base))), 21938#true, 21939#false, 21940#(= 0 |DUPFFnew_#t~malloc1.offset|), 21941#(= 0 DUPFFnew_~ans~0.offset), 21942#(= 0 |DUPFFnew_#res.offset|), 21943#(= 0 |main_#t~ret44.offset|), 21944#(= 0 main_~f~0.offset), 21945#(= 0 |DUPFFexgcd_#in~f.offset|), 21946#(= 0 DUPFFexgcd_~f.offset), 21947#(and (or (= DUPFFdeg_~f.base |DUPFFdeg_#in~f.base|) (not (= DUPFFdeg_~f.offset 0))) (or (= |DUPFFdeg_#in~f.offset| DUPFFdeg_~f.offset) (= DUPFFdeg_~f.offset 0))), 21948#(or (<= 8 (select |#length| |DUPFFdeg_#in~f.base|)) (not (= |DUPFFdeg_#in~f.offset| 0))), 21949#(and (= 0 DUPFFexgcd_~f.offset) (<= 8 (select |#length| DUPFFexgcd_~f.base))), 21950#(and (<= 8 (select |#length| |DUPFFexgcd_#in~g.base|)) (= 0 |DUPFFexgcd_#in~g.offset|)), 21951#(and (<= 8 (select |#length| DUPFFexgcd_~g.base)) (= 0 DUPFFexgcd_~g.offset))] [2018-02-02 09:55:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-02-02 09:55:24,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:55:24,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:55:24,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:55:24,679 INFO L87 Difference]: Start difference. First operand 381 states and 523 transitions. Second operand 16 states. [2018-02-02 09:55:25,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:25,145 INFO L93 Difference]: Finished difference Result 487 states and 653 transitions. [2018-02-02 09:55:25,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:55:25,145 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 110 [2018-02-02 09:55:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:25,146 INFO L225 Difference]: With dead ends: 487 [2018-02-02 09:55:25,146 INFO L226 Difference]: Without dead ends: 487 [2018-02-02 09:55:25,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:55:25,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-02-02 09:55:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 446. [2018-02-02 09:55:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-02 09:55:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 635 transitions. [2018-02-02 09:55:25,153 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 635 transitions. Word has length 110 [2018-02-02 09:55:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:25,154 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 635 transitions. [2018-02-02 09:55:25,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:55:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 635 transitions. [2018-02-02 09:55:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 09:55:25,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:25,155 INFO L351 BasicCegarLoop]: trace histogram [20, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:25,155 INFO L371 AbstractCegarLoop]: === Iteration 44 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:25,155 INFO L82 PathProgramCache]: Analyzing trace with hash 634280140, now seen corresponding path program 1 times [2018-02-02 09:55:25,155 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:25,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-02-02 09:55:25,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:25,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:55:25,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:55:25,197 INFO L182 omatonBuilderFactory]: Interpolants [22902#true, 22903#false, 22904#|DUPFFexgcd_#t~short14|] [2018-02-02 09:55:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-02-02 09:55:25,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:55:25,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:55:25,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:55:25,198 INFO L87 Difference]: Start difference. First operand 446 states and 635 transitions. Second operand 3 states. [2018-02-02 09:55:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:25,203 INFO L93 Difference]: Finished difference Result 449 states and 635 transitions. [2018-02-02 09:55:25,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:55:25,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-02-02 09:55:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:25,205 INFO L225 Difference]: With dead ends: 449 [2018-02-02 09:55:25,205 INFO L226 Difference]: Without dead ends: 446 [2018-02-02 09:55:25,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:55:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-02-02 09:55:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2018-02-02 09:55:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-02 09:55:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 632 transitions. [2018-02-02 09:55:25,210 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 632 transitions. Word has length 109 [2018-02-02 09:55:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:25,210 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 632 transitions. [2018-02-02 09:55:25,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:55:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 632 transitions. [2018-02-02 09:55:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-02 09:55:25,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:25,211 INFO L351 BasicCegarLoop]: trace histogram [20, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:25,211 INFO L371 AbstractCegarLoop]: === Iteration 45 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:25,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1293061200, now seen corresponding path program 1 times [2018-02-02 09:55:25,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:25,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-02-02 09:55:27,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:27,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 09:55:27,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 09:55:27,244 INFO L182 omatonBuilderFactory]: Interpolants [23808#(and (or (and (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| |DUPFFnew_#t~mem5.base|)) (= DUPFFnew_~ans~0.offset 0) (= |DUPFFnew_#t~mem5.base| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~mem5.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))))) (not (= DUPFFnew_~maxdeg 1))) (= (select |#valid| DUPFFnew_~ans~0.base) 1) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 23809#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 23810#(= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|))), 23811#(and (= (select |#valid| DUPFFnew_~ans~0.base) 1) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)) (or (and (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))))) (not (= DUPFFnew_~maxdeg 1)))), 23812#(and (or (not (= |DUPFFnew_#in~maxdeg| 1)) (and (= 0 DUPFFnew_~ans~0.offset) (not (= DUPFFnew_~ans~0.base (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))))) (= (select |#valid| DUPFFnew_~ans~0.base) 1)), 23813#(or (and (= 0 |DUPFFnew_#res.offset|) (not (= |DUPFFnew_#res.base| (select (select |#memory_$Pointer$.base| |DUPFFnew_#res.base|) (+ 0 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |DUPFFnew_#res.base|) (+ 0 8)))) (= (select |#valid| |DUPFFnew_#res.base|) 1)) (not (= |DUPFFnew_#in~maxdeg| 1))), 23814#(and (not (= |main_#t~ret44.base| (select (select |#memory_$Pointer$.base| |main_#t~ret44.base|) (+ 0 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~ret44.base|) (+ 0 8)))) (= 0 |main_#t~ret44.offset|) (= (select |#valid| |main_#t~ret44.base|) 1)), 23815#(and (= (select |#valid| main_~f~0.base) 1) (not (= main_~f~0.base (select (select |#memory_$Pointer$.base| main_~f~0.base) (+ main_~f~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~f~0.base) (+ main_~f~0.offset 8)))) (= main_~f~0.offset 0)), 23816#(and (= (select |#valid| main_~f~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~f~0.base) (+ main_~f~0.offset 8)))) (not (= |main_#t~mem45.base| main_~f~0.base)) (= main_~f~0.offset 0)), 23817#(and (= (select |#valid| main_~f~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~f~0.base) (+ main_~f~0.offset 8)))) (= main_~f~0.offset 0)), 23818#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 23819#(and (= 0 |DUPFFnew_#t~malloc1.offset|) (= 0 (select |old(#valid)| |DUPFFnew_#t~malloc1.base|)) (= |#valid| (store |old(#valid)| |DUPFFnew_#t~malloc1.base| (select |#valid| |DUPFFnew_#t~malloc1.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 23820#(and (= DUPFFnew_~ans~0.offset 0) (or (= |#valid| |old(#valid)|) (= DUPFFnew_~ans~0.base (@diff |old(#valid)| |#valid|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| DUPFFnew_~ans~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 23821#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| DUPFFnew_~ans~0.base (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base))) (= (select |#valid| DUPFFnew_~ans~0.base) 1) (= DUPFFnew_~ans~0.offset 0) (= 0 (select |old(#valid)| DUPFFnew_~ans~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 23822#(and (= 1 (select |#valid| |DUPFFnew_#t~malloc3.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| DUPFFnew_~ans~0.base (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base))) (= DUPFFnew_~ans~0.offset 0) (= 0 (select |old(#valid)| |DUPFFnew_#t~malloc3.base|)) (= (store (store |old(#valid)| |DUPFFnew_#t~malloc3.base| (select |#valid| |DUPFFnew_#t~malloc3.base|)) (@diff (store |old(#valid)| |DUPFFnew_#t~malloc3.base| (select |#valid| |DUPFFnew_#t~malloc3.base|)) |#valid|) (select |#valid| (@diff (store |old(#valid)| |DUPFFnew_#t~malloc3.base| (select |#valid| |DUPFFnew_#t~malloc3.base|)) |#valid|))) |#valid|) (= 0 (select |old(#valid)| DUPFFnew_~ans~0.base)) (or (= |#valid| (store |old(#valid)| |DUPFFnew_#t~malloc3.base| (select |#valid| |DUPFFnew_#t~malloc3.base|))) (= DUPFFnew_~ans~0.base (@diff (store |old(#valid)| |DUPFFnew_#t~malloc3.base| (select |#valid| |DUPFFnew_#t~malloc3.base|)) |#valid|))) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~malloc3.base|))), 23823#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| DUPFFnew_~ans~0.base (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base))) (= DUPFFnew_~ans~0.offset 0) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (not (= DUPFFnew_~ans~0.base (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= 0 (select |old(#valid)| DUPFFnew_~ans~0.base))), 23824#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| DUPFFnew_~ans~0.base (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base))) (= DUPFFnew_~ans~0.offset 0) (= 0 (select |old(#valid)| |DUPFFnew_#t~mem5.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~mem5.base|)) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= 0 (select |old(#valid)| DUPFFnew_~ans~0.base))), 23825#(and (= DUPFFnew_~ans~0.offset 0) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| DUPFFnew_~ans~0.base (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base)) (@diff (store |old(#memory_$Pointer$.base)| DUPFFnew_~ans~0.base (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base)) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| DUPFFnew_~ans~0.base (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base)) |#memory_$Pointer$.base|)))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| DUPFFnew_~ans~0.base (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base))) (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| DUPFFnew_~ans~0.base (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base)) |#memory_$Pointer$.base|)))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= 0 (select |old(#valid)| DUPFFnew_~ans~0.base))), 23826#(and (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (= 0 |DUPFFnew_#res.offset|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (= 0 (select |old(#valid)| |DUPFFnew_#res.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 1 (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |DUPFFnew_#res.base|) (+ (- 0) 8))))), 23827#(and (not (= main_~f~0.base |main_#t~ret48.base|)) (= 0 |main_#t~ret48.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~f~0.base) (+ main_~f~0.offset 8)))) (not (= main_~f~0.base (select (select |#memory_$Pointer$.base| |main_#t~ret48.base|) (+ 4 4)))) (= main_~f~0.offset 0)), 23828#(and (not (= main_~f~0.base main_~g~0.base)) (= main_~g~0.offset 0) (not (= main_~f~0.base (select (select |#memory_$Pointer$.base| main_~g~0.base) (+ main_~g~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~f~0.base) (+ main_~f~0.offset 8)))) (= main_~f~0.offset 0)), 23829#(and (not (= main_~f~0.base main_~g~0.base)) (= main_~g~0.offset 0) (not (= main_~f~0.base |main_#t~mem49.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~f~0.base) (+ main_~f~0.offset 8)))) (= main_~f~0.offset 0)), 23830#(and (not (= main_~f~0.base main_~g~0.base)) (= main_~g~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~f~0.base) (+ main_~f~0.offset 8)))) (= main_~f~0.offset 0)), 23831#(and (= 0 |DUPFFexgcd_#in~f.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |DUPFFexgcd_#in~f.base|) (+ 4 4))))), 23832#(and (= DUPFFexgcd_~f.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFexgcd_~f.base) (+ DUPFFexgcd_~f.offset 8))))), 23833#(= 1 (select |#valid| |DUPFFexgcd_#t~mem15.base|)), 23800#true, 23801#false, 23802#(or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)), 23803#(and (or (= 0 |DUPFFnew_#t~malloc1.offset|) (not (= DUPFFnew_~maxdeg 1))) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 23804#(and (or (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~maxdeg 1))) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 23805#(and (or (and (= (select |#valid| DUPFFnew_~ans~0.base) 1) (= DUPFFnew_~ans~0.offset 0)) (not (= DUPFFnew_~maxdeg 1))) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1))), 23806#(and (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)) (or (and (= 1 (select |#valid| |DUPFFnew_#t~malloc3.base|)) (= DUPFFnew_~ans~0.offset 0) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| |DUPFFnew_#t~malloc3.base|)) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~malloc3.base|))) (not (= DUPFFnew_~maxdeg 1)))), 23807#(and (= (select |#valid| DUPFFnew_~ans~0.base) 1) (or (and (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))))) (not (= DUPFFnew_~maxdeg 1))) (or (= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= DUPFFnew_~maxdeg 1)))] [2018-02-02 09:55:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-02-02 09:55:27,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 09:55:27,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 09:55:27,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:55:27,245 INFO L87 Difference]: Start difference. First operand 446 states and 632 transitions. Second operand 34 states. [2018-02-02 09:55:28,307 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 74 DAG size of output 72 [2018-02-02 09:55:28,462 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 72 DAG size of output 70 [2018-02-02 09:55:28,717 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 113 DAG size of output 78 [2018-02-02 09:55:28,965 WARN L146 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 110 DAG size of output 93 [2018-02-02 09:55:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:31,772 INFO L93 Difference]: Finished difference Result 464 states and 671 transitions. [2018-02-02 09:55:31,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 09:55:31,772 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 116 [2018-02-02 09:55:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:31,774 INFO L225 Difference]: With dead ends: 464 [2018-02-02 09:55:31,774 INFO L226 Difference]: Without dead ends: 464 [2018-02-02 09:55:31,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=349, Invalid=3191, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 09:55:31,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-02 09:55:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 446. [2018-02-02 09:55:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-02 09:55:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 631 transitions. [2018-02-02 09:55:31,779 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 631 transitions. Word has length 116 [2018-02-02 09:55:31,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:31,779 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 631 transitions. [2018-02-02 09:55:31,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 09:55:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 631 transitions. [2018-02-02 09:55:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-02 09:55:31,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:31,780 INFO L351 BasicCegarLoop]: trace histogram [20, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:31,780 INFO L371 AbstractCegarLoop]: === Iteration 46 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:31,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1293061201, now seen corresponding path program 1 times [2018-02-02 09:55:31,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:31,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-02-02 09:55:32,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:32,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 09:55:32,136 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 09:55:32,136 INFO L182 omatonBuilderFactory]: Interpolants [24800#(= 0 |DUPFFnew_#res.offset|), 24801#(= 0 |main_#t~ret48.offset|), 24802#(= 0 main_~g~0.offset), 24803#(and (= 0 main_~g~0.offset) (= (select (select |#memory_int| main_~g~0.base) 4) 2)), 24804#(and (= (select (select |#memory_int| |DUPFFexgcd_#in~g.base|) 4) 2) (= 0 |DUPFFexgcd_#in~g.offset|)), 24805#(and (= (select (select |#memory_int| DUPFFexgcd_~g.base) 4) 2) (= 0 DUPFFexgcd_~g.offset)), 24806#(and (or (= |DUPFFexgcd_#t~ret12| 1) (= (select (select |#memory_int| DUPFFexgcd_~g.base) 4) 2)) (= 0 DUPFFexgcd_~g.offset)), 24807#(or (and (not (= (select (select |#memory_int| DUPFFexgcd_~g.base) 4) 1)) (= 0 DUPFFexgcd_~g.offset)) |DUPFFexgcd_#t~short14|), 24808#(and (not (= (select (select |#memory_int| DUPFFexgcd_~g.base) 4) 1)) (= 0 DUPFFexgcd_~g.offset)), 24809#(and (or (= DUPFFdeg_~f.base |DUPFFdeg_#in~f.base|) (not (= 0 DUPFFdeg_~f.offset))) (or (= |DUPFFdeg_#in~f.offset| DUPFFdeg_~f.offset) (= 0 DUPFFdeg_~f.offset))), 24810#(or (= |DUPFFdeg_#t~mem0| (select (select |#memory_int| |DUPFFdeg_#in~f.base|) 4)) (not (= |DUPFFdeg_#in~f.offset| 0))), 24811#(or (= |DUPFFdeg_#res| (select (select |#memory_int| |DUPFFdeg_#in~f.base|) 4)) (not (= |DUPFFdeg_#in~f.offset| 0))), 24812#(not (= |DUPFFexgcd_#t~ret13| 1)), 24813#|DUPFFexgcd_#t~short14|, 24796#true, 24797#false, 24798#(= 0 |DUPFFnew_#t~malloc1.offset|), 24799#(= DUPFFnew_~ans~0.offset 0)] [2018-02-02 09:55:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-02-02 09:55:32,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:55:32,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:55:32,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:55:32,137 INFO L87 Difference]: Start difference. First operand 446 states and 631 transitions. Second operand 18 states. [2018-02-02 09:55:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:32,567 INFO L93 Difference]: Finished difference Result 373 states and 496 transitions. [2018-02-02 09:55:32,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:55:32,568 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 116 [2018-02-02 09:55:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:32,569 INFO L225 Difference]: With dead ends: 373 [2018-02-02 09:55:32,570 INFO L226 Difference]: Without dead ends: 362 [2018-02-02 09:55:32,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:55:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-02-02 09:55:32,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2018-02-02 09:55:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-02 09:55:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 484 transitions. [2018-02-02 09:55:32,576 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 484 transitions. Word has length 116 [2018-02-02 09:55:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:32,577 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 484 transitions. [2018-02-02 09:55:32,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:55:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 484 transitions. [2018-02-02 09:55:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-02 09:55:32,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:32,578 INFO L351 BasicCegarLoop]: trace histogram [20, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 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-02-02 09:55:32,578 INFO L371 AbstractCegarLoop]: === Iteration 47 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:32,578 INFO L82 PathProgramCache]: Analyzing trace with hash -514380970, now seen corresponding path program 3 times [2018-02-02 09:55:32,580 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:32,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-02-02 09:55:32,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:32,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 09:55:32,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:55:32,678 INFO L182 omatonBuilderFactory]: Interpolants [25568#(= 1 (select |#valid| DUPFFexgcd_~f.base)), 25569#(= 1 (select |#valid| |DUPFFexgcd_#in~g.base|)), 25570#(= 1 (select |#valid| DUPFFexgcd_~g.base)), 25571#(= 1 (select |#valid| |DUPFFexgcd_#in~f.base|)), 25572#(= 1 (select |#valid| DUPFFdeg_~f.base)), 25564#true, 25565#false, 25566#(= DUPFFdeg_~f.base |DUPFFdeg_#in~f.base|), 25567#(= 1 (select |#valid| |DUPFFdeg_#in~f.base|))] [2018-02-02 09:55:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-02-02 09:55:32,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:55:32,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:55:32,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:55:32,679 INFO L87 Difference]: Start difference. First operand 362 states and 484 transitions. Second operand 9 states. [2018-02-02 09:55:32,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:32,956 INFO L93 Difference]: Finished difference Result 378 states and 502 transitions. [2018-02-02 09:55:32,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:55:32,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2018-02-02 09:55:32,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:32,958 INFO L225 Difference]: With dead ends: 378 [2018-02-02 09:55:32,958 INFO L226 Difference]: Without dead ends: 378 [2018-02-02 09:55:32,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:55:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-02-02 09:55:32,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 364. [2018-02-02 09:55:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-02-02 09:55:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 487 transitions. [2018-02-02 09:55:32,965 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 487 transitions. Word has length 120 [2018-02-02 09:55:32,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:32,966 INFO L432 AbstractCegarLoop]: Abstraction has 364 states and 487 transitions. [2018-02-02 09:55:32,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:55:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 487 transitions. [2018-02-02 09:55:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-02 09:55:32,966 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:32,967 INFO L351 BasicCegarLoop]: trace histogram [20, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 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-02-02 09:55:32,967 INFO L371 AbstractCegarLoop]: === Iteration 48 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:32,967 INFO L82 PathProgramCache]: Analyzing trace with hash -514380969, now seen corresponding path program 3 times [2018-02-02 09:55:32,967 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:32,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-02-02 09:55:33,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:33,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 09:55:33,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:55:33,210 INFO L182 omatonBuilderFactory]: Interpolants [26336#(and (= DUPFFdeg_~f.base |DUPFFdeg_#in~f.base|) (or (= |DUPFFdeg_#in~f.offset| DUPFFdeg_~f.offset) (= DUPFFdeg_~f.offset 0))), 26337#(or (<= 8 (select |#length| |DUPFFdeg_#in~f.base|)) (not (= |DUPFFdeg_#in~f.offset| 0))), 26338#(and (<= 8 (select |#length| DUPFFexgcd_~g.base)) (= 0 DUPFFexgcd_~g.offset)), 26339#(and (= 0 |DUPFFexgcd_#in~f.offset|) (<= 8 (select |#length| |DUPFFexgcd_#in~f.base|))), 26340#(and (= 0 DUPFFexgcd_~f.offset) (<= 8 (select |#length| DUPFFexgcd_~f.base))), 26341#(and (= 0 |DUPFFdeg_#in~f.offset|) (<= 8 (select |#length| |DUPFFdeg_#in~f.base|))), 26342#(and (= DUPFFdeg_~f.offset 0) (<= 8 (select |#length| DUPFFdeg_~f.base))), 26325#true, 26326#false, 26327#(= 0 |DUPFFnew_#t~malloc1.offset|), 26328#(= 0 DUPFFnew_~ans~0.offset), 26329#(= 0 |DUPFFnew_#res.offset|), 26330#(= 0 |main_#t~ret44.offset|), 26331#(= 0 main_~f~0.offset), 26332#(= 0 |DUPFFexgcd_#in~f.offset|), 26333#(= 0 DUPFFexgcd_~f.offset), 26334#(= 0 |DUPFFexgcd_#in~g.offset|), 26335#(= 0 DUPFFexgcd_~g.offset)] [2018-02-02 09:55:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-02-02 09:55:33,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:55:33,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:55:33,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:55:33,211 INFO L87 Difference]: Start difference. First operand 364 states and 487 transitions. Second operand 18 states. [2018-02-02 09:55:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:33,869 INFO L93 Difference]: Finished difference Result 403 states and 498 transitions. [2018-02-02 09:55:33,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:55:33,869 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2018-02-02 09:55:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:33,871 INFO L225 Difference]: With dead ends: 403 [2018-02-02 09:55:33,871 INFO L226 Difference]: Without dead ends: 403 [2018-02-02 09:55:33,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:55:33,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-02 09:55:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 372. [2018-02-02 09:55:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-02-02 09:55:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 492 transitions. [2018-02-02 09:55:33,875 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 492 transitions. Word has length 120 [2018-02-02 09:55:33,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:33,875 INFO L432 AbstractCegarLoop]: Abstraction has 372 states and 492 transitions. [2018-02-02 09:55:33,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:55:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 492 transitions. [2018-02-02 09:55:33,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-02 09:55:33,875 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:33,876 INFO L351 BasicCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:33,876 INFO L371 AbstractCegarLoop]: === Iteration 49 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash -56272186, now seen corresponding path program 1 times [2018-02-02 09:55:33,876 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:33,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 132 proven. 18 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-02-02 09:55:34,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:34,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 09:55:34,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 09:55:34,357 INFO L182 omatonBuilderFactory]: Interpolants [27137#true, 27138#false, 27139#(= 0 |DUPFFnew_#t~malloc1.offset|), 27140#(= DUPFFnew_~ans~0.offset 0), 27141#(and (= (select |#valid| DUPFFnew_~ans~0.base) 1) (= DUPFFnew_~ans~0.offset 0)), 27142#(and (= 1 (select |#valid| |DUPFFnew_#t~malloc3.base|)) (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~malloc3.base|))), 27143#(and (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))))), 27144#(and (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~mem5.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8))))), 27145#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 27146#(= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|))), 27147#(and (not (= |DUPFFnew_#res.base| (select (select |#memory_$Pointer$.base| |DUPFFnew_#res.base|) (+ (- 0) 8)))) (= 0 |DUPFFnew_#res.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |DUPFFnew_#res.base|) (+ (- 0) 8))))), 27148#(and (= 0 |main_#t~ret48.offset|) (not (= |main_#t~ret48.base| (select (select |#memory_$Pointer$.base| |main_#t~ret48.base|) (+ 0 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~ret48.base|) (+ 0 8))))), 27149#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~g~0.base) (+ main_~g~0.offset 8)))) (= main_~g~0.offset 0) (not (= main_~g~0.base (select (select |#memory_$Pointer$.base| main_~g~0.base) (+ main_~g~0.offset 8))))), 27150#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~g~0.base) (+ main_~g~0.offset 8)))) (= main_~g~0.offset 0) (not (= |main_#t~mem49.base| main_~g~0.base))), 27151#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~g~0.base) (+ main_~g~0.offset 8)))) (= main_~g~0.offset 0)), 27152#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |DUPFFexgcd_#in~g.base|) (+ 0 8)))) (= 0 |DUPFFexgcd_#in~g.offset|)), 27153#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFexgcd_~g.base) (+ 0 8)))) (= 0 DUPFFexgcd_~g.offset)), 27154#(and (= 0 |DUPFFexgcd_#in~f.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |DUPFFexgcd_#in~f.base|) (+ 0 8))))), 27155#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| DUPFFexgcd_~f.base) (+ DUPFFexgcd_~f.offset 8)))), 27156#(= 1 (select |#valid| |DUPFFexgcd_#t~mem15.base|))] [2018-02-02 09:55:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 132 proven. 18 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-02-02 09:55:34,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 09:55:34,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 09:55:34,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:55:34,358 INFO L87 Difference]: Start difference. First operand 372 states and 492 transitions. Second operand 20 states. [2018-02-02 09:55:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:35,293 INFO L93 Difference]: Finished difference Result 412 states and 558 transitions. [2018-02-02 09:55:35,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:55:35,293 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 133 [2018-02-02 09:55:35,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:35,295 INFO L225 Difference]: With dead ends: 412 [2018-02-02 09:55:35,295 INFO L226 Difference]: Without dead ends: 412 [2018-02-02 09:55:35,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 09:55:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-02 09:55:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 389. [2018-02-02 09:55:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-02-02 09:55:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 516 transitions. [2018-02-02 09:55:35,299 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 516 transitions. Word has length 133 [2018-02-02 09:55:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:35,299 INFO L432 AbstractCegarLoop]: Abstraction has 389 states and 516 transitions. [2018-02-02 09:55:35,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 09:55:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 516 transitions. [2018-02-02 09:55:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-02-02 09:55:35,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:35,300 INFO L351 BasicCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:35,300 INFO L371 AbstractCegarLoop]: === Iteration 50 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:35,300 INFO L82 PathProgramCache]: Analyzing trace with hash -56272185, now seen corresponding path program 1 times [2018-02-02 09:55:35,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:35,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 137 proven. 21 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-02-02 09:55:36,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:55:36,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 09:55:36,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:55:36,346 INFO L182 omatonBuilderFactory]: Interpolants [27989#true, 27990#false, 27991#(= 0 |DUPFFnew_#t~malloc1.offset|), 27992#(= DUPFFnew_~ans~0.offset 0), 27993#(and (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg)), 27994#(and (= 0 |DUPFFnew_#t~malloc1.offset|) (= 12 (select |#length| |DUPFFnew_#t~malloc1.base|)) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg)), 27995#(and (= DUPFFnew_~ans~0.offset 0) (= 12 (select |#length| DUPFFnew_~ans~0.base)) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg)), 27996#(and (= (select |#valid| DUPFFnew_~ans~0.base) 1) (= DUPFFnew_~ans~0.offset 0) (= 12 (select |#length| DUPFFnew_~ans~0.base)) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg)), 27997#(and (= DUPFFnew_~ans~0.offset 0) (= 0 |DUPFFnew_#t~malloc3.offset|) (= 12 (select |#length| DUPFFnew_~ans~0.base)) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| |DUPFFnew_#t~malloc3.base|)) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~malloc3.base|))), 27998#(and (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= 12 (select |#length| DUPFFnew_~ans~0.base)) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= 0 (select (select |#memory_$Pointer$.offset| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))), 27999#(and (= (+ (* 4 DUPFFnew_~maxdeg) 4) (select |#length| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= 12 (select |#length| DUPFFnew_~ans~0.base)) (<= DUPFFnew_~maxdeg |DUPFFnew_#in~maxdeg|) (not (= DUPFFnew_~ans~0.base |DUPFFnew_#t~mem5.base|)) (<= |DUPFFnew_#in~maxdeg| DUPFFnew_~maxdeg) (= 0 (select (select |#memory_$Pointer$.offset| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))), 28000#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28001#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |#Ultimate.C_memset_#ptr.base| (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|)))), 28002#(and (= DUPFFnew_~ans~0.offset 0) (not (= DUPFFnew_~ans~0.base (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= 12 (select |#length| DUPFFnew_~ans~0.base)) (= (+ (* 4 |DUPFFnew_#in~maxdeg|) 4) (select |#length| (select (select |#memory_$Pointer$.base| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| DUPFFnew_~ans~0.base) (+ DUPFFnew_~ans~0.offset 8)))), 28003#(and (not (= |DUPFFnew_#res.base| (select (select |#memory_$Pointer$.base| |DUPFFnew_#res.base|) (+ (- 0) 8)))) (= 0 |DUPFFnew_#res.offset|) (= 12 (select |#length| |DUPFFnew_#res.base|)) (= (+ (* 4 |DUPFFnew_#in~maxdeg|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |DUPFFnew_#res.base|) (+ (- 0) 8)))) (= 0 (select (select |#memory_$Pointer$.offset| |DUPFFnew_#res.base|) (+ (- 0) 8)))), 28004#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~ret48.base|) (+ 0 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~ret48.base|) (+ 0 8)))) (= 0 |main_#t~ret48.offset|) (= 12 (select |#length| |main_#t~ret48.base|)) (not (= |main_#t~ret48.base| (select (select |#memory_$Pointer$.base| |main_#t~ret48.base|) (+ 0 8))))), 28005#(and (= main_~g~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~g~0.base) (+ main_~g~0.offset 8))) (= (select |#length| main_~g~0.base) (select |#length| (select (select |#memory_$Pointer$.base| main_~g~0.base) (+ main_~g~0.offset 8))))) (<= (select |#length| main_~g~0.base) 11)) (not (= main_~g~0.base (select (select |#memory_$Pointer$.base| main_~g~0.base) (+ main_~g~0.offset 8))))), 28006#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~g~0.base) (+ main_~g~0.offset 8))) (= main_~g~0.offset 0) (< 11 (select |#length| main_~g~0.base)) (not (= |main_#t~mem49.base| main_~g~0.base)) (= (select |#length| main_~g~0.base) (select |#length| (select (select |#memory_$Pointer$.base| main_~g~0.base) (+ main_~g~0.offset 8))))), 28007#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~g~0.base) (+ main_~g~0.offset 8))) (= main_~g~0.offset 0) (< 11 (select |#length| main_~g~0.base)) (= (select |#length| main_~g~0.base) (select |#length| (select (select |#memory_$Pointer$.base| main_~g~0.base) (+ main_~g~0.offset 8))))), 28008#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |DUPFFexgcd_#in~g.base|) (+ 0 8)))) (= 0 |DUPFFexgcd_#in~g.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |DUPFFexgcd_#in~g.base|) (+ 0 8)))), 28009#(and (= 0 (select (select |#memory_$Pointer$.offset| DUPFFexgcd_~g.base) (+ 0 8))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| DUPFFexgcd_~g.base) (+ 0 8)))) (= 0 DUPFFexgcd_~g.offset)), 28010#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |DUPFFexgcd_#in~f.base|) (+ 0 8)))) (= 0 (select (select |#memory_$Pointer$.offset| |DUPFFexgcd_#in~f.base|) (+ 0 8))) (= 0 |DUPFFexgcd_#in~f.offset|)), 28011#(and (= DUPFFexgcd_~f.offset 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| DUPFFexgcd_~f.base) (+ DUPFFexgcd_~f.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| DUPFFexgcd_~f.base) (+ DUPFFexgcd_~f.offset 8)))), 28012#(= DUPFFdeg_~f.base |DUPFFdeg_#in~f.base|), 28013#(and (<= 12 (select |#length| |DUPFFexgcd_#t~mem15.base|)) (= |DUPFFexgcd_#t~mem15.offset| 0))] [2018-02-02 09:55:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 137 proven. 21 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-02-02 09:55:36,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 09:55:36,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 09:55:36,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:55:36,346 INFO L87 Difference]: Start difference. First operand 389 states and 516 transitions. Second operand 25 states. [2018-02-02 09:55:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:37,808 INFO L93 Difference]: Finished difference Result 410 states and 543 transitions. [2018-02-02 09:55:37,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:55:37,808 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 133 [2018-02-02 09:55:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:37,810 INFO L225 Difference]: With dead ends: 410 [2018-02-02 09:55:37,810 INFO L226 Difference]: Without dead ends: 410 [2018-02-02 09:55:37,810 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=1599, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 09:55:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-02-02 09:55:37,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 391. [2018-02-02 09:55:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-02-02 09:55:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 516 transitions. [2018-02-02 09:55:37,814 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 516 transitions. Word has length 133 [2018-02-02 09:55:37,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:37,814 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 516 transitions. [2018-02-02 09:55:37,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 09:55:37,814 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 516 transitions. [2018-02-02 09:55:37,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-02 09:55:37,815 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:37,815 INFO L351 BasicCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:37,815 INFO L371 AbstractCegarLoop]: === Iteration 51 === [DUPFFnewErr7RequiresViolation, DUPFFnewErr5RequiresViolation, DUPFFnewErr10RequiresViolation, DUPFFnewErr2RequiresViolation, DUPFFnewErr3RequiresViolation, DUPFFnewErr9RequiresViolation, DUPFFnewErr11RequiresViolation, DUPFFnewErr8RequiresViolation, DUPFFnewErr4RequiresViolation, DUPFFnewErr0RequiresViolation, DUPFFnewErr1RequiresViolation, DUPFFnewErr6RequiresViolation, DUPFFexgcdErr7RequiresViolation, DUPFFexgcdErr14RequiresViolation, DUPFFexgcdErr19RequiresViolation, DUPFFexgcdErr22RequiresViolation, DUPFFexgcdErr12RequiresViolation, DUPFFexgcdErr27RequiresViolation, DUPFFexgcdErr17RequiresViolation, DUPFFexgcdErr16RequiresViolation, DUPFFexgcdErr5RequiresViolation, DUPFFexgcdErr6RequiresViolation, DUPFFexgcdErr2RequiresViolation, DUPFFexgcdErr9RequiresViolation, DUPFFexgcdErr26RequiresViolation, DUPFFexgcdErr3RequiresViolation, DUPFFexgcdErr18RequiresViolation, DUPFFexgcdErr13RequiresViolation, DUPFFexgcdErr23RequiresViolation, DUPFFexgcdErr15RequiresViolation, DUPFFexgcdErr8RequiresViolation, DUPFFexgcdErr10RequiresViolation, DUPFFexgcdErr20RequiresViolation, DUPFFexgcdErr1RequiresViolation, DUPFFexgcdErr21RequiresViolation, DUPFFexgcdErr25RequiresViolation, DUPFFexgcdErr0RequiresViolation, DUPFFexgcdErr4RequiresViolation, DUPFFexgcdErr24RequiresViolation, DUPFFexgcdErr11RequiresViolation, DUPFFdegErr1RequiresViolation, DUPFFdegErr0RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-02 09:55:37,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2064899401, now seen corresponding path program 1 times [2018-02-02 09:55:37,816 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 09:55:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 09:55:38,077 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 09:55:38,095 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-02-02 09:55:38,098 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-02-02 09:55:38,105 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 09:55:38,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:55:38 BoogieIcfgContainer [2018-02-02 09:55:38,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:55:38,126 INFO L168 Benchmark]: Toolchain (without parser) took 36824.83 ms. Allocated memory was 402.7 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 359.3 MB in the beginning and 1.3 GB in the end (delta: -962.1 MB). Peak memory consumption was 310.4 MB. Max. memory is 5.3 GB. [2018-02-02 09:55:38,127 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:55:38,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.44 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 343.5 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-02 09:55:38,127 INFO L168 Benchmark]: Boogie Preprocessor took 38.80 ms. Allocated memory is still 402.7 MB. Free memory was 343.5 MB in the beginning and 340.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:55:38,127 INFO L168 Benchmark]: RCFGBuilder took 554.99 ms. Allocated memory is still 402.7 MB. Free memory was 340.8 MB in the beginning and 291.8 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 5.3 GB. [2018-02-02 09:55:38,128 INFO L168 Benchmark]: TraceAbstraction took 36033.82 ms. Allocated memory was 402.7 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 289.2 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 240.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:55:38,129 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.12 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.44 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 343.5 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.80 ms. Allocated memory is still 402.7 MB. Free memory was 343.5 MB in the beginning and 340.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 554.99 ms. Allocated memory is still 402.7 MB. Free memory was 340.8 MB in the beginning and 291.8 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 36033.82 ms. Allocated memory was 402.7 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 289.2 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 240.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1045]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1045. Possible FailurePath: [L1047] DUPFF f, g, cf, cg, h; VAL [f={15:0}, g={16:0}] [L1048] CALL, EXPR DUPFFnew(1) VAL [\old(maxdeg)=1] [L975] EXPR, FCALL malloc(sizeof(struct DUPFFstruct)) VAL [\old(maxdeg)=1, malloc(sizeof(struct DUPFFstruct))={39:0}, maxdeg=1] [L975] DUPFF ans = (DUPFF)malloc(sizeof(struct DUPFFstruct)); VAL [\old(maxdeg)=1, ans={39:0}, malloc(sizeof(struct DUPFFstruct))={39:0}, maxdeg=1] [L976] FCALL ans->coeffs = 0 VAL [\old(maxdeg)=1, ans={39:0}, malloc(sizeof(struct DUPFFstruct))={39:0}, maxdeg=1] [L977] COND TRUE maxdeg >= 0 VAL [\old(maxdeg)=1, ans={39:0}, malloc(sizeof(struct DUPFFstruct))={39:0}, maxdeg=1] [L978] EXPR, FCALL malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=1, ans={39:0}, malloc((maxdeg+1)*sizeof(FFelem))={14:0}, malloc(sizeof(struct DUPFFstruct))={39:0}, maxdeg=1] [L978] FCALL ans->coeffs = (FFelem*)malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=1, ans={39:0}, malloc((maxdeg+1)*sizeof(FFelem))={14:0}, malloc(sizeof(struct DUPFFstruct))={39:0}, maxdeg=1] [L979] EXPR, FCALL ans->coeffs VAL [\old(maxdeg)=1, ans={39:0}, ans->coeffs={14:0}, malloc((maxdeg+1)*sizeof(FFelem))={14:0}, malloc(sizeof(struct DUPFFstruct))={39:0}, maxdeg=1] [L979] FCALL memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=1, ans={39:0}, ans->coeffs={14:0}, malloc((maxdeg+1)*sizeof(FFelem))={14:0}, malloc(sizeof(struct DUPFFstruct))={39:0}, maxdeg=1, memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem))={14:0}] [L981] FCALL ans->maxdeg = maxdeg VAL [\old(maxdeg)=1, ans={39:0}, malloc((maxdeg+1)*sizeof(FFelem))={14:0}, malloc(sizeof(struct DUPFFstruct))={39:0}, maxdeg=1] [L982] FCALL ans->deg = -1 VAL [\old(maxdeg)=1, ans={39:0}, malloc((maxdeg+1)*sizeof(FFelem))={14:0}, malloc(sizeof(struct DUPFFstruct))={39:0}, maxdeg=1] [L983] RET return ans; VAL [\old(maxdeg)=1, \result={39:0}, ans={39:0}, malloc((maxdeg+1)*sizeof(FFelem))={14:0}, malloc(sizeof(struct DUPFFstruct))={39:0}, maxdeg=1] [L1048] EXPR DUPFFnew(1) VAL [DUPFFnew(1)={39:0}, f={15:0}, g={16:0}] [L1048] f = DUPFFnew(1) [L1048] EXPR, FCALL f->coeffs VAL [f={39:0}, f={15:0}, f->coeffs={14:0}, g={16:0}] [L1048] FCALL f->coeffs[1] = 1 VAL [f={39:0}, f={15:0}, f->coeffs={14:0}, g={16:0}] [L1048] FCALL f->deg = 1 VAL [f={15:0}, f={39:0}, g={16:0}] [L1049] CALL, EXPR DUPFFnew(2) VAL [\old(maxdeg)=2] [L975] EXPR, FCALL malloc(sizeof(struct DUPFFstruct)) VAL [\old(maxdeg)=2, malloc(sizeof(struct DUPFFstruct))={24:0}, maxdeg=2] [L975] DUPFF ans = (DUPFF)malloc(sizeof(struct DUPFFstruct)); VAL [\old(maxdeg)=2, ans={24:0}, malloc(sizeof(struct DUPFFstruct))={24:0}, maxdeg=2] [L976] FCALL ans->coeffs = 0 VAL [\old(maxdeg)=2, ans={24:0}, malloc(sizeof(struct DUPFFstruct))={24:0}, maxdeg=2] [L977] COND TRUE maxdeg >= 0 VAL [\old(maxdeg)=2, ans={24:0}, malloc(sizeof(struct DUPFFstruct))={24:0}, maxdeg=2] [L978] EXPR, FCALL malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=2, ans={24:0}, malloc((maxdeg+1)*sizeof(FFelem))={35:0}, malloc(sizeof(struct DUPFFstruct))={24:0}, maxdeg=2] [L978] FCALL ans->coeffs = (FFelem*)malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=2, ans={24:0}, malloc((maxdeg+1)*sizeof(FFelem))={35:0}, malloc(sizeof(struct DUPFFstruct))={24:0}, maxdeg=2] [L979] EXPR, FCALL ans->coeffs VAL [\old(maxdeg)=2, ans={24:0}, ans->coeffs={35:0}, malloc((maxdeg+1)*sizeof(FFelem))={35:0}, malloc(sizeof(struct DUPFFstruct))={24:0}, maxdeg=2] [L979] FCALL memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=2, ans={24:0}, ans->coeffs={35:0}, malloc((maxdeg+1)*sizeof(FFelem))={35:0}, malloc(sizeof(struct DUPFFstruct))={24:0}, maxdeg=2, memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem))={35:0}] [L981] FCALL ans->maxdeg = maxdeg VAL [\old(maxdeg)=2, ans={24:0}, malloc((maxdeg+1)*sizeof(FFelem))={35:0}, malloc(sizeof(struct DUPFFstruct))={24:0}, maxdeg=2] [L982] FCALL ans->deg = -1 VAL [\old(maxdeg)=2, ans={24:0}, malloc((maxdeg+1)*sizeof(FFelem))={35:0}, malloc(sizeof(struct DUPFFstruct))={24:0}, maxdeg=2] [L983] RET return ans; VAL [\old(maxdeg)=2, \result={24:0}, ans={24:0}, malloc((maxdeg+1)*sizeof(FFelem))={35:0}, malloc(sizeof(struct DUPFFstruct))={24:0}, maxdeg=2] [L1049] EXPR DUPFFnew(2) VAL [DUPFFnew(2)={24:0}, f={15:0}, f={39:0}, g={16:0}] [L1049] g = DUPFFnew(2) [L1049] EXPR, FCALL g->coeffs VAL [f={15:0}, f={39:0}, g={16:0}, g={24:0}, g->coeffs={35:0}] [L1049] FCALL g->coeffs[2] = 1 VAL [f={39:0}, f={15:0}, g={24:0}, g={16:0}, g->coeffs={35:0}] [L1049] FCALL g->deg = 2 VAL [f={15:0}, f={39:0}, g={24:0}, g={16:0}] [L1050] CALL, EXPR DUPFFexgcd(&cf, &cg, f, g) VAL [f={39:0}, fcofac={15:0}, g={24:0}, gcofac={16:0}] [L1000] DUPFF u, v, uf, ug, vf, vg; [L1001] FFelem q, lcu, lcvrecip, p; [L1002] int df, dg, du, dv; VAL [f={39:0}, f={39:0}, fcofac={15:0}, fcofac={15:0}, g={24:0}, g={24:0}, gcofac={16:0}, gcofac={16:0}] [L1003] CALL, EXPR DUPFFdeg(f) VAL [f={39:0}] [L971] EXPR, FCALL f->deg VAL [f={39:0}, f={39:0}, f->deg=1] [L971] RET return f->deg; [L1003] EXPR DUPFFdeg(f) VAL [DUPFFdeg(f)=1, f={39:0}, f={39:0}, fcofac={15:0}, fcofac={15:0}, g={24:0}, g={24:0}, gcofac={16:0}, gcofac={16:0}] [L1003] CALL, EXPR DUPFFdeg(g) VAL [f={24:0}] [L971] EXPR, FCALL f->deg VAL [f={24:0}, f={24:0}, f->deg=2] [L971] RET return f->deg; [L1003] EXPR DUPFFdeg(g) VAL [DUPFFdeg(f)=1, DUPFFdeg(g)=2, f={39:0}, f={39:0}, fcofac={15:0}, fcofac={15:0}, g={24:0}, g={24:0}, gcofac={16:0}, gcofac={16:0}] [L1003] COND TRUE DUPFFdeg(f) < DUPFFdeg(g) [L1003] CALL, EXPR DUPFFexgcd(gcofac, fcofac, g, f) VAL [f={24:0}, fcofac={16:0}, g={39:0}, gcofac={15:0}] [L1000] DUPFF u, v, uf, ug, vf, vg; [L1001] FFelem q, lcu, lcvrecip, p; [L1002] int df, dg, du, dv; VAL [f={24:0}, f={24:0}, fcofac={16:0}, fcofac={16:0}, g={39:0}, g={39:0}, gcofac={15:0}, gcofac={15:0}] [L1003] CALL, EXPR DUPFFdeg(f) VAL [f={24:0}] [L971] EXPR, FCALL f->deg VAL [f={24:0}, f={24:0}, f->deg=2] [L971] RET return f->deg; [L1003] EXPR DUPFFdeg(f) VAL [DUPFFdeg(f)=2, f={24:0}, f={24:0}, fcofac={16:0}, fcofac={16:0}, g={39:0}, g={39:0}, gcofac={15:0}, gcofac={15:0}] [L1003] CALL, EXPR DUPFFdeg(g) VAL [f={39:0}] [L971] EXPR, FCALL f->deg VAL [f={39:0}, f={39:0}, f->deg=1] [L971] RET return f->deg; [L1003] EXPR DUPFFdeg(g) VAL [DUPFFdeg(f)=2, DUPFFdeg(g)=1, f={24:0}, f={24:0}, fcofac={16:0}, fcofac={16:0}, g={39:0}, g={39:0}, gcofac={15:0}, gcofac={15:0}] [L1003] COND FALSE !(DUPFFdeg(f) < DUPFFdeg(g)) [L1004] CALL, EXPR DUPFFdeg(f) VAL [f={24:0}] [L971] EXPR, FCALL f->deg VAL [f={24:0}, f={24:0}, f->deg=2] [L971] RET return f->deg; [L1004] EXPR DUPFFdeg(f) VAL [DUPFFdeg(f)=2, f={24:0}, f={24:0}, fcofac={16:0}, fcofac={16:0}, g={39:0}, g={39:0}, gcofac={15:0}, gcofac={15:0}] [L1004] DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1 VAL [DUPFFdeg(f)=2, DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1=0, f={24:0}, f={24:0}, fcofac={16:0}, fcofac={16:0}, g={39:0}, g={39:0}, gcofac={15:0}, gcofac={15:0}] [L1004] CALL, EXPR DUPFFdeg(g) VAL [f={39:0}] [L971] EXPR, FCALL f->deg VAL [f={39:0}, f={39:0}, f->deg=1] [L971] RET return f->deg; [L1004] EXPR DUPFFdeg(g) VAL [DUPFFdeg(f)=2, DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1=0, DUPFFdeg(g)=1, f={24:0}, f={24:0}, fcofac={16:0}, fcofac={16:0}, g={39:0}, g={39:0}, gcofac={15:0}, gcofac={15:0}] [L1004] DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1 VAL [DUPFFdeg(f)=2, DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1=0, DUPFFdeg(g)=1, f={24:0}, f={24:0}, fcofac={16:0}, fcofac={16:0}, g={39:0}, g={39:0}, gcofac={15:0}, gcofac={15:0}] [L1004] COND FALSE !(DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1) [L1005] EXPR, FCALL f->coeffs VAL [f={24:0}, f={24:0}, f->coeffs={35:0}, fcofac={16:0}, fcofac={16:0}, g={39:0}, g={39:0}, gcofac={15:0}, gcofac={15:0}] [L1005] EXPR, FCALL f->coeffs[0] VAL [f={24:0}, f={24:0}, f->coeffs={35:0}, f->coeffs[0]=0, fcofac={16:0}, fcofac={16:0}, g={39:0}, g={39:0}, gcofac={15:0}, gcofac={15:0}] [L1005] COND TRUE f->coeffs[0] == 0 [L1005] RET return f; VAL [\result={24:0}, f={24:0}, f={24:0}, fcofac={16:0}, fcofac={16:0}, g={39:0}, g={39:0}, gcofac={15:0}, gcofac={15:0}] [L1003] EXPR DUPFFexgcd(gcofac, fcofac, g, f) VAL [DUPFFexgcd(gcofac, fcofac, g, f)={24:0}, f={39:0}, f={39:0}, fcofac={15:0}, fcofac={15:0}, g={24:0}, g={24:0}, gcofac={16:0}, gcofac={16:0}] [L1003] RET return DUPFFexgcd(gcofac, fcofac, g, f); [L1050] EXPR DUPFFexgcd(&cf, &cg, f, g) VAL [DUPFFexgcd(&cf, &cg, f, g)={24:0}, f={39:0}, f={15:0}, g={24:0}, g={16:0}] [L1050] h = DUPFFexgcd(&cf, &cg, f, g) [L1051] h = h [L1052] return 0; VAL [\result=0, f={15:0}, f={39:0}, g={24:0}, g={16:0}, h={24:0}] [L1052] return 0; VAL [\result=0, f={39:0}, g={24:0}, g={16:0}, h={24:0}] [L1052] return 0; VAL [\result=0, f={39:0}, g={24:0}, h={24:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 210 locations, 55 error locations. UNSAFE Result, 35.9s OverallTime, 51 OverallIterations, 20 TraceHistogramMax, 23.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10633 SDtfs, 4084 SDslu, 68590 SDs, 0 SdLazy, 28853 SolverSat, 1961 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1052 GetRequests, 200 SyntacticMatches, 28 SemanticMatches, 824 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3474 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 5972/6639 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 50 MinimizatonAttempts, 717 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 3535 NumberOfCodeBlocks, 3535 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3340 ConstructedInterpolants, 0 QuantifiedInterpolants, 1405704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 17 PerfectInterpolantSequences, 5972/6639 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-55-38-134.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20020406-1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-55-38-134.csv Received shutdown request...