/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/condmf.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-8fc6572
[2020-07-10 15:26:05,437 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-07-10 15:26:05,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-10 15:26:05,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-10 15:26:05,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-10 15:26:05,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-10 15:26:05,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-10 15:26:05,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-10 15:26:05,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-10 15:26:05,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-10 15:26:05,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-07-10 15:26:05,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-10 15:26:05,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-10 15:26:05,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-10 15:26:05,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-10 15:26:05,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-10 15:26:05,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-10 15:26:05,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-10 15:26:05,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-10 15:26:05,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-10 15:26:05,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-10 15:26:05,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-10 15:26:05,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-07-10 15:26:05,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-10 15:26:05,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-10 15:26:05,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-10 15:26:05,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-10 15:26:05,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-10 15:26:05,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-10 15:26:05,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-10 15:26:05,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-10 15:26:05,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-10 15:26:05,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-10 15:26:05,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-10 15:26:05,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-10 15:26:05,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-10 15:26:05,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-10 15:26:05,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-10 15:26:05,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-10 15:26:05,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-10 15:26:05,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-07-10 15:26:05,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-07-10 15:26:05,564 INFO L113 SettingsManager]: Loading preferences was successful
[2020-07-10 15:26:05,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-10 15:26:05,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-07-10 15:26:05,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-07-10 15:26:05,569 INFO L138 SettingsManager]: * Use SBE=true
[2020-07-10 15:26:05,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-10 15:26:05,569 INFO L138 SettingsManager]: * sizeof long=4
[2020-07-10 15:26:05,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-07-10 15:26:05,570 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-07-10 15:26:05,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-07-10 15:26:05,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-07-10 15:26:05,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-10 15:26:05,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-07-10 15:26:05,571 INFO L138 SettingsManager]: * sizeof long double=12
[2020-07-10 15:26:05,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-07-10 15:26:05,571 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-07-10 15:26:05,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-07-10 15:26:05,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-10 15:26:05,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-07-10 15:26:05,572 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-07-10 15:26:05,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-07-10 15:26:05,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-10 15:26:05,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-10 15:26:05,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-07-10 15:26:05,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-07-10 15:26:05,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-07-10 15:26:05,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-10 15:26:05,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-10 15:26:05,575 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2020-07-10 15:26:05,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2020-07-10 15:26:05,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-10 15:26:05,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-10 15:26:05,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-10 15:26:05,909 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-07-10 15:26:05,909 INFO L275 PluginConnector]: CDTParser initialized
[2020-07-10 15:26:05,910 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condmf.c
[2020-07-10 15:26:05,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af40235d6/0fd9ad32ba064eb0bcf41a033805a814/FLAG2d7593f0a
[2020-07-10 15:26:06,460 INFO L306 CDTParser]: Found 1 translation units.
[2020-07-10 15:26:06,461 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condmf.c
[2020-07-10 15:26:06,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af40235d6/0fd9ad32ba064eb0bcf41a033805a814/FLAG2d7593f0a
[2020-07-10 15:26:06,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af40235d6/0fd9ad32ba064eb0bcf41a033805a814
[2020-07-10 15:26:06,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-10 15:26:06,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-10 15:26:06,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-10 15:26:06,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-10 15:26:06,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-10 15:26:06,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:06" (1/1) ...
[2020-07-10 15:26:06,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544e6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:06, skipping insertion in model container
[2020-07-10 15:26:06,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:06" (1/1) ...
[2020-07-10 15:26:06,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-07-10 15:26:06,858 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-07-10 15:26:07,041 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-10 15:26:07,052 INFO L203 MainTranslator]: Completed pre-run
[2020-07-10 15:26:07,075 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-10 15:26:07,093 INFO L208 MainTranslator]: Completed translation
[2020-07-10 15:26:07,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:07 WrapperNode
[2020-07-10 15:26:07,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-10 15:26:07,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-10 15:26:07,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-10 15:26:07,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-07-10 15:26:07,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:07" (1/1) ...
[2020-07-10 15:26:07,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:07" (1/1) ...
[2020-07-10 15:26:07,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:07" (1/1) ...
[2020-07-10 15:26:07,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:07" (1/1) ...
[2020-07-10 15:26:07,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:07" (1/1) ...
[2020-07-10 15:26:07,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:07" (1/1) ...
[2020-07-10 15:26:07,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:07" (1/1) ...
[2020-07-10 15:26:07,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-10 15:26:07,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-10 15:26:07,224 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-07-10 15:26:07,224 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-07-10 15:26:07,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:07" (1/1) ...
No working directory specified, using /storage/repos/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
[2020-07-10 15:26:07,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-10 15:26:07,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-10 15:26:07,286 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2020-07-10 15:26:07,287 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2020-07-10 15:26:07,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2020-07-10 15:26:07,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-10 15:26:07,287 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2020-07-10 15:26:07,287 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2020-07-10 15:26:07,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2020-07-10 15:26:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-10 15:26:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure malloc
[2020-07-10 15:26:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2020-07-10 15:26:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2020-07-10 15:26:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-07-10 15:26:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2020-07-10 15:26:07,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-10 15:26:07,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-10 15:26:07,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-07-10 15:26:07,751 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-10 15:26:07,752 INFO L295 CfgBuilder]: Removed 3 assume(true) statements.
[2020-07-10 15:26:07,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:07 BoogieIcfgContainer
[2020-07-10 15:26:07,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-10 15:26:07,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-10 15:26:07,761 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-07-10 15:26:07,766 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-07-10 15:26:07,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:06" (1/3) ...
[2020-07-10 15:26:07,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de48399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:07, skipping insertion in model container
[2020-07-10 15:26:07,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:07" (2/3) ...
[2020-07-10 15:26:07,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de48399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:07, skipping insertion in model container
[2020-07-10 15:26:07,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:07" (3/3) ...
[2020-07-10 15:26:07,774 INFO L109 eAbstractionObserver]: Analyzing ICFG condmf.c
[2020-07-10 15:26:07,785 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-07-10 15:26:07,794 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-10 15:26:07,807 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-10 15:26:07,831 INFO L375 AbstractCegarLoop]: Interprodecural is true
[2020-07-10 15:26:07,831 INFO L376 AbstractCegarLoop]: Hoare is true
[2020-07-10 15:26:07,831 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-07-10 15:26:07,831 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-10 15:26:07,831 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-10 15:26:07,831 INFO L380 AbstractCegarLoop]: Difference is false
[2020-07-10 15:26:07,831 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-10 15:26:07,832 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-10 15:26:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states.
[2020-07-10 15:26:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-07-10 15:26:07,855 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 15:26:07,856 INFO L422 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]
[2020-07-10 15:26:07,857 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 15:26:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 15:26:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1524373234, now seen corresponding path program 1 times
[2020-07-10 15:26:07,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 15:26:07,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640830264]
[2020-07-10 15:26:07,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 15:26:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:26:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:26:08,109 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {38#true} is VALID
[2020-07-10 15:26:08,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID
[2020-07-10 15:26:08,110 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID
[2020-07-10 15:26:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:26:08,123 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID
[2020-07-10 15:26:08,125 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID
[2020-07-10 15:26:08,125 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID
[2020-07-10 15:26:08,126 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID
[2020-07-10 15:26:08,128 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID
[2020-07-10 15:26:08,129 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {38#true} is VALID
[2020-07-10 15:26:08,129 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID
[2020-07-10 15:26:08,130 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID
[2020-07-10 15:26:08,130 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret8 := main(); {38#true} is VALID
[2020-07-10 15:26:08,130 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {38#true} is VALID
[2020-07-10 15:26:08,131 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~N~0 <= 0); {38#true} is VALID
[2020-07-10 15:26:08,131 INFO L263 TraceCheckUtils]: 7: Hoare triple {38#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {38#true} is VALID
[2020-07-10 15:26:08,132 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID
[2020-07-10 15:26:08,133 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID
[2020-07-10 15:26:08,133 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} assume true; {39#false} is VALID
[2020-07-10 15:26:08,134 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID
[2020-07-10 15:26:08,134 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {39#false} is VALID
[2020-07-10 15:26:08,135 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID
[2020-07-10 15:26:08,135 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID
[2020-07-10 15:26:08,136 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID
[2020-07-10 15:26:08,136 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID
[2020-07-10 15:26:08,137 INFO L280 TraceCheckUtils]: 17: Hoare triple {39#false} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {39#false} is VALID
[2020-07-10 15:26:08,137 INFO L263 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if (if #t~mem7 < 0 && 0 != #t~mem7 % 2 then #t~mem7 % 2 - 2 else #t~mem7 % 2) == (if ~N~0 < 0 && 0 != ~N~0 % 2 then ~N~0 % 2 - 2 else ~N~0 % 2) then 1 else 0)); {39#false} is VALID
[2020-07-10 15:26:08,138 INFO L280 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID
[2020-07-10 15:26:08,138 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID
[2020-07-10 15:26:08,138 INFO L280 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID
[2020-07-10 15:26:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-10 15:26:08,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640830264]
[2020-07-10 15:26:08,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-10 15:26:08,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-07-10 15:26:08,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162002188]
[2020-07-10 15:26:08,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22
[2020-07-10 15:26:08,156 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-10 15:26:08,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states.
[2020-07-10 15:26:08,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 15:26:08,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-07-10 15:26:08,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-10 15:26:08,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-07-10 15:26:08,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-07-10 15:26:08,221 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states.
[2020-07-10 15:26:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:26:08,448 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions.
[2020-07-10 15:26:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-07-10 15:26:08,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22
[2020-07-10 15:26:08,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 15:26:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-07-10 15:26:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions.
[2020-07-10 15:26:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-07-10 15:26:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions.
[2020-07-10 15:26:08,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions.
[2020-07-10 15:26:08,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 15:26:08,629 INFO L225 Difference]: With dead ends: 60
[2020-07-10 15:26:08,630 INFO L226 Difference]: Without dead ends: 30
[2020-07-10 15:26:08,634 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-07-10 15:26:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2020-07-10 15:26:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2020-07-10 15:26:08,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 15:26:08,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states.
[2020-07-10 15:26:08,693 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states.
[2020-07-10 15:26:08,693 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states.
[2020-07-10 15:26:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:26:08,698 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions.
[2020-07-10 15:26:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions.
[2020-07-10 15:26:08,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:26:08,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:26:08,699 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states.
[2020-07-10 15:26:08,699 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states.
[2020-07-10 15:26:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:26:08,703 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions.
[2020-07-10 15:26:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions.
[2020-07-10 15:26:08,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:26:08,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:26:08,704 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-10 15:26:08,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 15:26:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2020-07-10 15:26:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions.
[2020-07-10 15:26:08,709 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22
[2020-07-10 15:26:08,710 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-10 15:26:08,710 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions.
[2020-07-10 15:26:08,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-07-10 15:26:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions.
[2020-07-10 15:26:08,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-07-10 15:26:08,711 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 15:26:08,712 INFO L422 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]
[2020-07-10 15:26:08,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-10 15:26:08,712 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 15:26:08,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 15:26:08,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2111179248, now seen corresponding path program 1 times
[2020-07-10 15:26:08,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 15:26:08,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024849391]
[2020-07-10 15:26:08,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 15:26:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:26:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:26:08,837 INFO L280 TraceCheckUtils]: 0: Hoare triple {238#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {227#true} is VALID
[2020-07-10 15:26:08,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID
[2020-07-10 15:26:08,838 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #86#return; {227#true} is VALID
[2020-07-10 15:26:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:26:08,848 INFO L280 TraceCheckUtils]: 0: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID
[2020-07-10 15:26:08,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID
[2020-07-10 15:26:08,849 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID
[2020-07-10 15:26:08,851 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #82#return; {232#(<= 1 ~N~0)} is VALID
[2020-07-10 15:26:08,852 INFO L263 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {238#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID
[2020-07-10 15:26:08,852 INFO L280 TraceCheckUtils]: 1: Hoare triple {238#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {227#true} is VALID
[2020-07-10 15:26:08,853 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID
[2020-07-10 15:26:08,853 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #86#return; {227#true} is VALID
[2020-07-10 15:26:08,853 INFO L263 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret8 := main(); {227#true} is VALID
[2020-07-10 15:26:08,854 INFO L280 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {227#true} is VALID
[2020-07-10 15:26:08,855 INFO L280 TraceCheckUtils]: 6: Hoare triple {227#true} assume !(~N~0 <= 0); {232#(<= 1 ~N~0)} is VALID
[2020-07-10 15:26:08,855 INFO L263 TraceCheckUtils]: 7: Hoare triple {232#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {227#true} is VALID
[2020-07-10 15:26:08,856 INFO L280 TraceCheckUtils]: 8: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID
[2020-07-10 15:26:08,856 INFO L280 TraceCheckUtils]: 9: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID
[2020-07-10 15:26:08,856 INFO L280 TraceCheckUtils]: 10: Hoare triple {227#true} assume true; {227#true} is VALID
[2020-07-10 15:26:08,858 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #82#return; {232#(<= 1 ~N~0)} is VALID
[2020-07-10 15:26:08,859 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#(<= 1 ~N~0)} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID
[2020-07-10 15:26:08,861 INFO L280 TraceCheckUtils]: 13: Hoare triple {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {228#false} is VALID
[2020-07-10 15:26:08,861 INFO L280 TraceCheckUtils]: 14: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID
[2020-07-10 15:26:08,861 INFO L280 TraceCheckUtils]: 15: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID
[2020-07-10 15:26:08,862 INFO L280 TraceCheckUtils]: 16: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID
[2020-07-10 15:26:08,862 INFO L280 TraceCheckUtils]: 17: Hoare triple {228#false} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {228#false} is VALID
[2020-07-10 15:26:08,862 INFO L263 TraceCheckUtils]: 18: Hoare triple {228#false} call __VERIFIER_assert((if (if #t~mem7 < 0 && 0 != #t~mem7 % 2 then #t~mem7 % 2 - 2 else #t~mem7 % 2) == (if ~N~0 < 0 && 0 != ~N~0 % 2 then ~N~0 % 2 - 2 else ~N~0 % 2) then 1 else 0)); {228#false} is VALID
[2020-07-10 15:26:08,863 INFO L280 TraceCheckUtils]: 19: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID
[2020-07-10 15:26:08,863 INFO L280 TraceCheckUtils]: 20: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID
[2020-07-10 15:26:08,863 INFO L280 TraceCheckUtils]: 21: Hoare triple {228#false} assume !false; {228#false} is VALID
[2020-07-10 15:26:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-10 15:26:08,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024849391]
[2020-07-10 15:26:08,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-10 15:26:08,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-07-10 15:26:08,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167542478]
[2020-07-10 15:26:08,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22
[2020-07-10 15:26:08,870 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-10 15:26:08,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states.
[2020-07-10 15:26:08,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 15:26:08,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-07-10 15:26:08,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-10 15:26:08,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-07-10 15:26:08,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-07-10 15:26:08,908 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states.
[2020-07-10 15:26:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:26:09,259 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions.
[2020-07-10 15:26:09,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-07-10 15:26:09,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22
[2020-07-10 15:26:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 15:26:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-10 15:26:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions.
[2020-07-10 15:26:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-10 15:26:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions.
[2020-07-10 15:26:09,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions.
[2020-07-10 15:26:09,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 15:26:09,370 INFO L225 Difference]: With dead ends: 54
[2020-07-10 15:26:09,370 INFO L226 Difference]: Without dead ends: 39
[2020-07-10 15:26:09,371 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-07-10 15:26:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2020-07-10 15:26:09,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32.
[2020-07-10 15:26:09,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 15:26:09,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 32 states.
[2020-07-10 15:26:09,404 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 32 states.
[2020-07-10 15:26:09,404 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 32 states.
[2020-07-10 15:26:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:26:09,409 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions.
[2020-07-10 15:26:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions.
[2020-07-10 15:26:09,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:26:09,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:26:09,411 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 39 states.
[2020-07-10 15:26:09,411 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 39 states.
[2020-07-10 15:26:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:26:09,415 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions.
[2020-07-10 15:26:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions.
[2020-07-10 15:26:09,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:26:09,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:26:09,417 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-10 15:26:09,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 15:26:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2020-07-10 15:26:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions.
[2020-07-10 15:26:09,420 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22
[2020-07-10 15:26:09,420 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-10 15:26:09,420 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions.
[2020-07-10 15:26:09,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-07-10 15:26:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions.
[2020-07-10 15:26:09,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-07-10 15:26:09,422 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 15:26:09,422 INFO L422 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]
[2020-07-10 15:26:09,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-10 15:26:09,423 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 15:26:09,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 15:26:09,423 INFO L82 PathProgramCache]: Analyzing trace with hash 373909448, now seen corresponding path program 1 times
[2020-07-10 15:26:09,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 15:26:09,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661922372]
[2020-07-10 15:26:09,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 15:26:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-10 15:26:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-10 15:26:09,577 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-07-10 15:26:09,578 INFO L520 BasicCegarLoop]: Counterexample might be feasible
[2020-07-10 15:26:09,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-07-10 15:26:09,630 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2020-07-10 15:26:09,630 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2020-07-10 15:26:09,630 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2020-07-10 15:26:09,630 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2020-07-10 15:26:09,631 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation
[2020-07-10 15:26:09,631 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation
[2020-07-10 15:26:09,631 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2020-07-10 15:26:09,631 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2020-07-10 15:26:09,631 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2020-07-10 15:26:09,631 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation
[2020-07-10 15:26:09,632 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation
[2020-07-10 15:26:09,632 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation
[2020-07-10 15:26:09,632 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation
[2020-07-10 15:26:09,632 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation
[2020-07-10 15:26:09,633 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation
[2020-07-10 15:26:09,634 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2020-07-10 15:26:09,635 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2020-07-10 15:26:09,635 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation
[2020-07-10 15:26:09,635 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation
[2020-07-10 15:26:09,635 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation
[2020-07-10 15:26:09,635 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation
[2020-07-10 15:26:09,636 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation
[2020-07-10 15:26:09,636 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation
[2020-07-10 15:26:09,636 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation
[2020-07-10 15:26:09,636 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2020-07-10 15:26:09,636 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation
[2020-07-10 15:26:09,636 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation
[2020-07-10 15:26:09,637 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2020-07-10 15:26:09,637 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation
[2020-07-10 15:26:09,637 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation
[2020-07-10 15:26:09,637 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation
[2020-07-10 15:26:09,642 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation
[2020-07-10 15:26:09,642 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation
[2020-07-10 15:26:09,643 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation
[2020-07-10 15:26:09,643 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation
[2020-07-10 15:26:09,643 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation
[2020-07-10 15:26:09,643 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation
[2020-07-10 15:26:09,643 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation
[2020-07-10 15:26:09,643 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation
[2020-07-10 15:26:09,644 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation
[2020-07-10 15:26:09,644 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation
[2020-07-10 15:26:09,644 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation
[2020-07-10 15:26:09,644 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation
[2020-07-10 15:26:09,644 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation
[2020-07-10 15:26:09,644 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation
[2020-07-10 15:26:09,645 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation
[2020-07-10 15:26:09,645 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation
[2020-07-10 15:26:09,645 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation
[2020-07-10 15:26:09,645 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2020-07-10 15:26:09,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:09 BoogieIcfgContainer
[2020-07-10 15:26:09,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-07-10 15:26:09,655 INFO L168 Benchmark]: Toolchain (without parser) took 2838.50 ms. Allocated memory was 144.7 MB in the beginning and 233.3 MB in the end (delta: 88.6 MB). Free memory was 104.5 MB in the beginning and 96.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 96.7 MB. Max. memory is 7.1 GB.
[2020-07-10 15:26:09,658 INFO L168 Benchmark]: CDTParser took 0.60 ms. Allocated memory is still 144.7 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB.
[2020-07-10 15:26:09,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.19 ms. Allocated memory is still 144.7 MB. Free memory was 104.3 MB in the beginning and 93.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB.
[2020-07-10 15:26:09,660 INFO L168 Benchmark]: Boogie Preprocessor took 128.92 ms. Allocated memory was 144.7 MB in the beginning and 203.9 MB in the end (delta: 59.2 MB). Free memory was 93.4 MB in the beginning and 181.6 MB in the end (delta: -88.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB.
[2020-07-10 15:26:09,662 INFO L168 Benchmark]: RCFGBuilder took 536.19 ms. Allocated memory is still 203.9 MB. Free memory was 181.6 MB in the beginning and 156.5 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB.
[2020-07-10 15:26:09,665 INFO L168 Benchmark]: TraceAbstraction took 1889.55 ms. Allocated memory was 203.9 MB in the beginning and 233.3 MB in the end (delta: 29.4 MB). Free memory was 155.8 MB in the beginning and 96.5 MB in the end (delta: 59.4 MB). Peak memory consumption was 88.7 MB. Max. memory is 7.1 GB.
[2020-07-10 15:26:09,673 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- AssertionsEnabledResult: Assertions are enabled
Assertions are enabled
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.60 ms. Allocated memory is still 144.7 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 278.19 ms. Allocated memory is still 144.7 MB. Free memory was 104.3 MB in the beginning and 93.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 128.92 ms. Allocated memory was 144.7 MB in the beginning and 203.9 MB in the end (delta: 59.2 MB). Free memory was 93.4 MB in the beginning and 181.6 MB in the end (delta: -88.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 536.19 ms. Allocated memory is still 203.9 MB. Free memory was 181.6 MB in the beginning and 156.5 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 1889.55 ms. Allocated memory was 203.9 MB in the beginning and 233.3 MB in the end (delta: 29.4 MB). Free memory was 155.8 MB in the beginning and 96.5 MB in the end (delta: 59.4 MB). Peak memory consumption was 88.7 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable
a call of __VERIFIER_error() is reachable
We found a FailurePath:
[L17] int N;
VAL [\old(N)=6, N=0]
[L21] N = __VERIFIER_nondet_int()
[L22] COND FALSE !(N <= 0)
VAL [\old(N)=0, N=1]
[L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int))
VAL [\old(cond)=1, \old(N)=0, N=1]
[L11] COND FALSE !(!cond)
VAL [\old(cond)=1, \old(N)=0, cond=1, N=1]
[L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int))
VAL [\old(N)=0, N=1]
[L25] int i;
[L26] int *a = malloc(sizeof(int)*N);
[L28] i = 0
VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1]
[L28] COND TRUE i < N
[L30] a[i] = 0
VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1]
[L28] i++
VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1]
[L28] COND FALSE !(i < N)
VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1]
[L33] i = 0
VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1]
[L33] COND TRUE i < N
VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1]
[L35] COND TRUE N%2 == 1
[L37] EXPR a[i]
[L37] a[i] = a[i] + 2
[L33] i++
VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1]
[L33] COND FALSE !(i < N)
VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1]
[L45] i = 0
VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1]
[L45] COND TRUE i < N
[L47] EXPR a[i]
VAL [\old(N)=0, a={-1:0}, a[i]=2, i=0, malloc(sizeof(int)*N)={-1:0}, N=1]
[L47] CALL __VERIFIER_assert(a[i] % 2 == N % 2)
VAL [\old(cond)=0, \old(N)=0, N=1]
[L13] COND TRUE !(cond)
VAL [\old(cond)=0, \old(N)=0, cond=0, N=1]
[L13] __VERIFIER_error()
VAL [\old(cond)=0, \old(N)=0, cond=0, N=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 57 SDtfs, 52 SDslu, 11 SDs, 0 SdLazy, 84 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 1596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...