java -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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-crafted/xor5.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 21:31:19,302 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-10-13 21:31:19,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 21:31:19,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 21:31:19,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 21:31:19,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 21:31:19,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 21:31:19,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 21:31:19,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 21:31:19,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 21:31:19,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 21:31:19,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 21:31:19,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 21:31:19,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 21:31:19,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 21:31:19,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 21:31:19,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 21:31:19,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 21:31:19,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 21:31:19,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 21:31:19,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 21:31:19,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 21:31:19,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 21:31:19,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 21:31:19,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 21:31:19,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 21:31:19,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 21:31:19,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 21:31:19,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 21:31:19,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 21:31:19,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 21:31:19,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 21:31:19,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 21:31:19,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 21:31:19,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 21:31:19,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 21:31:19,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 21:31:19,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 21:31:19,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 21:31:19,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 21:31:19,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 21:31:19,396 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
[2019-10-13 21:31:19,416 INFO L113 SettingsManager]: Loading preferences was successful
[2019-10-13 21:31:19,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 21:31:19,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 21:31:19,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-10-13 21:31:19,422 INFO L138 SettingsManager]: * Use SBE=true
[2019-10-13 21:31:19,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 21:31:19,423 INFO L138 SettingsManager]: * sizeof long=4
[2019-10-13 21:31:19,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-10-13 21:31:19,423 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-10-13 21:31:19,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-10-13 21:31:19,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 21:31:19,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 21:31:19,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 21:31:19,424 INFO L138 SettingsManager]: * sizeof long double=12
[2019-10-13 21:31:19,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-10-13 21:31:19,425 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-10-13 21:31:19,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-10-13 21:31:19,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 21:31:19,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-10-13 21:31:19,425 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-10-13 21:31:19,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-10-13 21:31:19,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 21:31:19,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 21:31:19,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 21:31:19,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 21:31:19,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-10-13 21:31:19,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 21:31:19,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 21:31:19,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK
[2019-10-13 21:31:19,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 21:31:19,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 21:31:19,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 21:31:19,717 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-10-13 21:31:19,717 INFO L275 PluginConnector]: CDTParser initialized
[2019-10-13 21:31:19,718 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/xor5.i
[2019-10-13 21:31:19,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e89dd0ff/db40e058118a4a789b933cfabce33f8f/FLAGc48efcb06
[2019-10-13 21:31:20,244 INFO L306 CDTParser]: Found 1 translation units.
[2019-10-13 21:31:20,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/xor5.i
[2019-10-13 21:31:20,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e89dd0ff/db40e058118a4a789b933cfabce33f8f/FLAGc48efcb06
[2019-10-13 21:31:20,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e89dd0ff/db40e058118a4a789b933cfabce33f8f
[2019-10-13 21:31:20,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 21:31:20,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 21:31:20,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 21:31:20,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 21:31:20,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 21:31:20,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:31:20" (1/1) ...
[2019-10-13 21:31:20,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@371dfc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:20, skipping insertion in model container
[2019-10-13 21:31:20,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:31:20" (1/1) ...
[2019-10-13 21:31:20,604 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-10-13 21:31:20,625 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-10-13 21:31:20,821 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:31:20,832 INFO L188 MainTranslator]: Completed pre-run
[2019-10-13 21:31:20,854 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:31:20,870 INFO L192 MainTranslator]: Completed translation
[2019-10-13 21:31:20,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:20 WrapperNode
[2019-10-13 21:31:20,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 21:31:20,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 21:31:20,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 21:31:20,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 21:31:20,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:20" (1/1) ...
[2019-10-13 21:31:20,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:20" (1/1) ...
[2019-10-13 21:31:20,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:20" (1/1) ...
[2019-10-13 21:31:20,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:20" (1/1) ...
[2019-10-13 21:31:20,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:20" (1/1) ...
[2019-10-13 21:31:20,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:20" (1/1) ...
[2019-10-13 21:31:20,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:20" (1/1) ...
[2019-10-13 21:31:20,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 21:31:20,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 21:31:20,994 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 21:31:20,994 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-10-13 21:31:20,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:20" (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
[2019-10-13 21:31:21,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 21:31:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 21:31:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure xor
[2019-10-13 21:31:21,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 21:31:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 21:31:21,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 21:31:21,051 INFO L130 BoogieDeclarations]: Found specification of procedure xor
[2019-10-13 21:31:21,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2019-10-13 21:31:21,052 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2019-10-13 21:31:21,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2019-10-13 21:31:21,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2019-10-13 21:31:21,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2019-10-13 21:31:21,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 21:31:21,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 21:31:21,444 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 21:31:21,445 INFO L284 CfgBuilder]: Removed 3 assume(true) statements.
[2019-10-13 21:31:21,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:31:21 BoogieIcfgContainer
[2019-10-13 21:31:21,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 21:31:21,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 21:31:21,448 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 21:31:21,451 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-10-13 21:31:21,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:31:20" (1/3) ...
[2019-10-13 21:31:21,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc4268c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:31:21, skipping insertion in model container
[2019-10-13 21:31:21,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:20" (2/3) ...
[2019-10-13 21:31:21,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc4268c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:31:21, skipping insertion in model container
[2019-10-13 21:31:21,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:31:21" (3/3) ...
[2019-10-13 21:31:21,455 INFO L109 eAbstractionObserver]: Analyzing ICFG xor5.i
[2019-10-13 21:31:21,465 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 21:31:21,472 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-13 21:31:21,485 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-13 21:31:21,512 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-10-13 21:31:21,512 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-10-13 21:31:21,512 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 21:31:21,512 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 21:31:21,512 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 21:31:21,513 INFO L378 AbstractCegarLoop]: Difference is false
[2019-10-13 21:31:21,513 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 21:31:21,513 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 21:31:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states.
[2019-10-13 21:31:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2019-10-13 21:31:21,540 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:31:21,541 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:31:21,543 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:31:21,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:31:21,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1813361058, now seen corresponding path program 1 times
[2019-10-13 21:31:21,555 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:31:21,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817488179]
[2019-10-13 21:31:21,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:31:21,556 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:31:21,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:31:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:31:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2019-10-13 21:31:21,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817488179]
[2019-10-13 21:31:21,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:31:21,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:31:21,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815283934]
[2019-10-13 21:31:21,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:31:21,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:31:21,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:31:21,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:31:21,882 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states.
[2019-10-13 21:31:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:31:21,975 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions.
[2019-10-13 21:31:21,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 21:31:21,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25
[2019-10-13 21:31:21,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:31:21,991 INFO L225 Difference]: With dead ends: 44
[2019-10-13 21:31:21,991 INFO L226 Difference]: Without dead ends: 21
[2019-10-13 21:31:21,999 INFO L600 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
[2019-10-13 21:31:22,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2019-10-13 21:31:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21.
[2019-10-13 21:31:22,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2019-10-13 21:31:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions.
[2019-10-13 21:31:22,064 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25
[2019-10-13 21:31:22,065 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:31:22,066 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions.
[2019-10-13 21:31:22,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:31:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions.
[2019-10-13 21:31:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2019-10-13 21:31:22,070 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:31:22,070 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:31:22,071 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:31:22,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:31:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash 796647951, now seen corresponding path program 1 times
[2019-10-13 21:31:22,072 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:31:22,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709190831]
[2019-10-13 21:31:22,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:31:22,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:31:22,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:31:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:31:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2019-10-13 21:31:22,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709190831]
[2019-10-13 21:31:22,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240468589]
[2019-10-13 21:31:22,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:31:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:31:22,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core
[2019-10-13 21:31:22,344 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 21:31:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2019-10-13 21:31:22,413 INFO L321 TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 21:31:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2019-10-13 21:31:22,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2089480381]
[2019-10-13 21:31:22,517 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest
[2019-10-13 21:31:22,518 INFO L169 IcfgInterpreter]: Building call graph
[2019-10-13 21:31:22,526 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start]
[2019-10-13 21:31:22,537 INFO L179 IcfgInterpreter]: Starting interpretation
[2019-10-13 21:31:22,537 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs
[2019-10-13 21:31:22,805 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs
[2019-10-13 21:31:24,616 INFO L199 IcfgInterpreter]: Interpreting procedure xor with input of size 1 for LOIs
[2019-10-13 21:31:24,625 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs
[2019-10-13 21:31:24,635 INFO L183 IcfgInterpreter]: Interpretation finished
[2019-10-13 21:31:24,635 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are:
[2019-10-13 21:31:24,635 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 444#(and (<= ~N~0 1) (<= 0 (+ main_~ret2~0 2147483648)) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~i~2 0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (<= main_~ret~0 2147483647) (<= main_~ret2~0 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (<= 0 main_~i~2) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0))
[2019-10-13 21:31:24,636 INFO L193 IcfgInterpreter]: Reachable states at location xorEXIT satisfy 524#(and (= |xor_#in~x.offset| xor_~x.offset) (= |xor_#in~x.base| xor_~x.base) (= 1 xor_~i~0) (<= ~N~0 1) (<= 1 xor_~i~0) (= (ite (<= (mod xor_~res~0 4294967296) 2147483647) (mod xor_~res~0 4294967296) (+ (mod xor_~res~0 4294967296) (- 4294967296))) |xor_#res|) (<= xor_~i~0 1) (not (< xor_~i~0 ~N~0)) (= xor_~res~0 (select (select |#memory_int| xor_~x.base) xor_~x.offset)))
[2019-10-13 21:31:24,636 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 38#(and (= 0 |#NULL.base|) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|))
[2019-10-13 21:31:24,636 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 528#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))
[2019-10-13 21:31:24,637 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 519#(and (= |xor_#in~x.offset| xor_~x.offset) (= |xor_#in~x.base| xor_~x.base) (= 1 xor_~i~0) (<= 1 xor_~i~0) (<= xor_~i~0 1) (= xor_~res~0 (select (select |#memory_int| xor_~x.base) xor_~x.offset)))
[2019-10-13 21:31:24,637 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 96#(and (or (and (not (<= (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) 2147483647)) (= |main_#t~ret6| (+ (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) (- 4294967296))) (not (< main_~i~1 ~N~0))) (and (not (< main_~i~1 ~N~0)) (<= (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) 2147483647) (= |main_#t~ret6| (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296)))) (<= ~N~0 1))
[2019-10-13 21:31:24,637 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 327#(and (or (and (<= ~N~0 1) (<= 0 (+ main_~ret2~0 2147483648)) (not (<= (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (= main_~ret5~0 (+ (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) (- 4294967296))) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0)) (and (<= ~N~0 1) (<= 0 (+ main_~ret2~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (= main_~ret5~0 (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296)) (<= (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) 2147483647) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0))) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~ret5~0 2147483647) (<= main_~i~2 0) (<= 0 (+ main_~ret5~0 2147483648)) (<= main_~ret~0 2147483647) (<= main_~ret2~0 2147483647) (<= 0 main_~i~2))
[2019-10-13 21:31:24,638 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 271#(and (<= 0 (+ main_~ret2~0 2147483648)) (<= ~N~0 1) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~ret5~0 2147483647) (<= main_~i~2 0) (<= 0 (+ main_~ret5~0 2147483648)) (<= main_~ret~0 2147483647) (<= main_~ret2~0 2147483647) (<= 0 main_~i~2) (= main_~i~2 0))
[2019-10-13 21:31:24,638 INFO L193 IcfgInterpreter]: Reachable states at location L29-4 satisfy 78#(not (< main_~i~1 ~N~0))
[2019-10-13 21:31:24,639 INFO L193 IcfgInterpreter]: Reachable states at location xorENTRY satisfy 514#true
[2019-10-13 21:31:24,640 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 500#(and (<= ~N~0 1) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~ret~0 2147483647))
[2019-10-13 21:31:24,640 INFO L193 IcfgInterpreter]: Reachable states at location L39-3 satisfy 483#(and (<= ~N~0 1) (<= 0 (+ main_~ret2~0 2147483648)) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~i~2 0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (<= main_~ret~0 2147483647) (<= main_~ret2~0 2147483647) (<= 0 main_~i~2) (= main_~i~2 0))
[2019-10-13 21:31:24,641 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 73#true
[2019-10-13 21:31:24,642 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 505#(and (or (and (not (< main_~i~1 ~N~0)) (= (mod main_~temp~0 4294967296) main_~ret~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod main_~temp~0 4294967296) 2147483647)) (and (not (< main_~i~1 ~N~0)) (= (mod main_~temp~0 4294967296) (+ main_~ret~0 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (< 2147483647 (mod main_~temp~0 4294967296)))) (<= ~N~0 1) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~ret~0 2147483647))
[2019-10-13 21:31:24,642 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))
[2019-10-13 21:31:24,643 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 ~N~0) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#memory_int| |old(#memory_int)|) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|))
[2019-10-13 21:31:24,643 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 533#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))
[2019-10-13 21:31:24,643 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true
[2019-10-13 21:31:24,644 INFO L193 IcfgInterpreter]: Reachable states at location L43-1 satisfy 374#(and (<= main_~i~2 0) (or (and (<= ~N~0 1) (<= 0 (+ main_~ret2~0 2147483648)) (<= 0 (+ main_~ret~0 2147483648)) (= |main_#t~ret13| (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (<= (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0)) (and (<= ~N~0 1) (<= 0 (+ main_~ret2~0 2147483648)) (not (<= (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) 2147483647)) (<= 0 (+ main_~ret~0 2147483648)) (= |main_#t~ret13| (+ (mod (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|) 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0))) (<= main_~ret~0 2147483647) (<= main_~ret2~0 2147483647) (<= 0 main_~i~2))
[2019-10-13 21:31:24,644 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 210#(and (<= 0 (+ main_~ret2~0 2147483648)) (<= ~N~0 1) (<= 0 (+ main_~ret~0 2147483648)) (<= main_~ret5~0 2147483647) (<= main_~i~2 0) (<= 0 (+ main_~ret5~0 2147483648)) (<= main_~ret~0 2147483647) (<= main_~ret2~0 2147483647) (<= 0 main_~i~2) (= main_~i~2 0))
[2019-10-13 21:31:25,584 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43
[2019-10-13 21:31:25,746 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42
[2019-10-13 21:31:25,749 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences.
[2019-10-13 21:31:25,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 17] total 25
[2019-10-13 21:31:25,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629856521]
[2019-10-13 21:31:25,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states
[2019-10-13 21:31:25,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:31:25,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2019-10-13 21:31:25,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600
[2019-10-13 21:31:25,754 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 25 states.
[2019-10-13 21:31:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:31:26,053 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions.
[2019-10-13 21:31:26,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-10-13 21:31:26,056 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26
[2019-10-13 21:31:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:31:26,057 INFO L225 Difference]: With dead ends: 36
[2019-10-13 21:31:26,057 INFO L226 Difference]: Without dead ends: 23
[2019-10-13 21:31:26,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812
[2019-10-13 21:31:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2019-10-13 21:31:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2019-10-13 21:31:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2019-10-13 21:31:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions.
[2019-10-13 21:31:26,072 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26
[2019-10-13 21:31:26,072 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:31:26,072 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions.
[2019-10-13 21:31:26,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states.
[2019-10-13 21:31:26,072 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions.
[2019-10-13 21:31:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2019-10-13 21:31:26,073 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:31:26,074 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:31:26,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:31:26,276 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:31:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:31:26,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1365141180, now seen corresponding path program 1 times
[2019-10-13 21:31:26,277 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:31:26,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10857181]
[2019-10-13 21:31:26,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:31:26,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:31:26,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:31:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:31:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2019-10-13 21:31:26,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10857181]
[2019-10-13 21:31:26,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:31:26,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:31:26,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134641290]
[2019-10-13 21:31:26,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:31:26,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 21:31:26,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:31:26,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:31:26,389 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states.
[2019-10-13 21:31:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:31:26,423 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions.
[2019-10-13 21:31:26,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 21:31:26,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30
[2019-10-13 21:31:26,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:31:26,426 INFO L225 Difference]: With dead ends: 33
[2019-10-13 21:31:26,426 INFO L226 Difference]: Without dead ends: 24
[2019-10-13 21:31:26,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:31:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2019-10-13 21:31:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2019-10-13 21:31:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2019-10-13 21:31:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions.
[2019-10-13 21:31:26,435 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 30
[2019-10-13 21:31:26,437 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:31:26,437 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions.
[2019-10-13 21:31:26,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:31:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions.
[2019-10-13 21:31:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2019-10-13 21:31:26,439 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:31:26,439 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:31:26,440 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:31:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:31:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash 765366277, now seen corresponding path program 1 times
[2019-10-13 21:31:26,440 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 21:31:26,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223703794]
[2019-10-13 21:31:26,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:31:26,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:31:26,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:31:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-10-13 21:31:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-10-13 21:31:26,635 INFO L168 tionRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace
[2019-10-13 21:31:26,636 INFO L445 BasicCegarLoop]: Counterexample might be feasible
[2019-10-13 21:31:26,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:31:26 BoogieIcfgContainer
[2019-10-13 21:31:26,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 21:31:26,701 INFO L168 Benchmark]: Toolchain (without parser) took 6110.50 ms. Allocated memory was 137.4 MB in the beginning and 289.4 MB in the end (delta: 152.0 MB). Free memory was 101.2 MB in the beginning and 214.2 MB in the end (delta: -113.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 7.1 GB.
[2019-10-13 21:31:26,702 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2019-10-13 21:31:26,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.54 ms. Allocated memory is still 137.4 MB. Free memory was 100.9 MB in the beginning and 90.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
[2019-10-13 21:31:26,706 INFO L168 Benchmark]: Boogie Preprocessor took 121.25 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 90.3 MB in the beginning and 179.4 MB in the end (delta: -89.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB.
[2019-10-13 21:31:26,707 INFO L168 Benchmark]: RCFGBuilder took 453.13 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 158.2 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB.
[2019-10-13 21:31:26,707 INFO L168 Benchmark]: TraceAbstraction took 5247.82 ms. Allocated memory was 201.9 MB in the beginning and 289.4 MB in the end (delta: 87.6 MB). Free memory was 158.2 MB in the beginning and 214.2 MB in the end (delta: -56.0 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB.
[2019-10-13 21:31:26,713 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 283.54 ms. Allocated memory is still 137.4 MB. Free memory was 100.9 MB in the beginning and 90.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 121.25 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 90.3 MB in the beginning and 179.4 MB in the end (delta: -89.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 453.13 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 158.2 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 5247.82 ms. Allocated memory was 201.9 MB in the beginning and 289.4 MB in the end (delta: 87.6 MB). Free memory was 158.2 MB in the beginning and 214.2 MB in the end (delta: -56.0 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 46]: Unable to prove that call of __VERIFIER_error() unreachable
Unable to prove that call of __VERIFIER_error() unreachable
Reason: overapproximation of bitwiseXor at line 14.
Possible FailurePath:
[L6] int N;
[L21] N = __VERIFIER_nondet_int()
[L22] COND TRUE N > 1
[L23] int x[N];
[L24] int temp;
[L25] int ret;
[L26] int ret2;
[L27] int ret5;
[L29] int i = 0;
VAL [\old(N)=0, i=0, N=2, x={1:0}]
[L29] COND TRUE i < N
[L31] x[i] = __VERIFIER_nondet_int()
[L29] i++
VAL [\old(N)=0, i=1, N=2, x={1:0}]
[L29] COND TRUE i < N
[L31] x[i] = __VERIFIER_nondet_int()
[L29] i++
VAL [\old(N)=0, i=2, N=2, x={1:0}]
[L29] COND FALSE !(i < N)
VAL [\old(N)=0, i=2, N=2, x={1:0}]
[L34] CALL, EXPR xor(x)
VAL [\old(N)=0, N=2, x={1:0}]
[L10] int i;
[L11] long long res;
[L12] EXPR x[0]
[L12] res = x[0]
[L13] i = 1
VAL [\old(N)=0, i=1, N=2, res=0, x={1:0}, x={1:0}]
[L13] COND TRUE i < N
[L14] EXPR x[i]
[L14] res = res ^ x[i]
[L13] i++
VAL [\old(N)=0, i=2, N=2, x={1:0}, x={1:0}]
[L13] COND FALSE !(i < N)
[L16] return res;
[L34] RET, EXPR xor(x)
VAL [\old(N)=0, i=2, N=2, x={1:0}, xor(x)=0]
[L34] ret = xor(x)
[L36] EXPR x[0]
[L36] temp=x[0]
[L36] EXPR x[1]
[L36] x[0] = x[1]
[L36] x[1] = temp
VAL [\old(N)=0, i=2, N=2, ret=0, temp=0, x={1:0}]
[L37] CALL, EXPR xor(x)
VAL [\old(N)=0, N=2, x={1:0}]
[L10] int i;
[L11] long long res;
[L12] EXPR x[0]
[L12] res = x[0]
[L13] i = 1
VAL [\old(N)=0, i=1, N=2, res=1, x={1:0}, x={1:0}]
[L13] COND TRUE i < N
[L14] EXPR x[i]
[L14] res = res ^ x[i]
[L13] i++
VAL [\old(N)=0, i=2, N=2, x={1:0}, x={1:0}]
[L13] COND FALSE !(i < N)
[L16] return res;
[L37] RET, EXPR xor(x)
VAL [\old(N)=0, i=2, N=2, ret=0, temp=0, x={1:0}, xor(x)=-2]
[L37] ret2 = xor(x)
[L38] EXPR x[0]
[L38] temp=x[0]
[L39] int i =0 ;
VAL [\old(N)=0, i=2, i=0, N=2, ret=0, ret2=-2, temp=1, x={1:0}]
[L39] COND TRUE i<N-1
[L40] EXPR x[i+1]
[L40] x[i] = x[i+1]
[L39] i++
VAL [\old(N)=0, i=1, i=2, N=2, ret=0, ret2=-2, temp=1, x={1:0}]
[L39] COND FALSE !(i<N-1)
[L42] x[N-1] = temp
VAL [\old(N)=0, i=1, i=2, N=2, ret=0, ret2=-2, temp=1, x={1:0}]
[L43] CALL, EXPR xor(x)
VAL [\old(N)=0, N=2, x={1:0}]
[L10] int i;
[L11] long long res;
[L12] EXPR x[0]
[L12] res = x[0]
[L13] i = 1
VAL [\old(N)=0, i=1, N=2, res=0, x={1:0}, x={1:0}]
[L13] COND TRUE i < N
[L14] EXPR x[i]
[L14] res = res ^ x[i]
[L13] i++
VAL [\old(N)=0, i=2, N=2, x={1:0}, x={1:0}]
[L13] COND FALSE !(i < N)
[L16] return res;
[L43] RET, EXPR xor(x)
VAL [\old(N)=0, i=1, i=2, N=2, ret=0, ret2=-2, temp=1, x={1:0}, xor(x)=-1]
[L43] ret5 = xor(x)
[L45] COND TRUE ret != ret2 || ret !=ret5
VAL [\old(N)=0, i=2, i=1, N=2, ret=0, ret2=-2, ret5=-1, temp=1, x={1:0}]
[L46] __VERIFIER_error()
VAL [\old(N)=0, i=2, i=1, N=2, ret=0, ret2=-2, ret5=-1, temp=1, x={1:0}]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 25 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.1s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 60 SDtfs, 33 SDslu, 58 SDs, 0 SdLazy, 165 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 4716 SizeOfPredicates, 3 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 57/63 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 2131, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 80, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 40, TOOLS_POST_TIME[ms]: 725, TOOLS_POST_CALL_APPLICATIONS: 33, TOOLS_POST_CALL_TIME[ms]: 86, TOOLS_POST_RETURN_APPLICATIONS: 28, TOOLS_POST_RETURN_TIME[ms]: 82, TOOLS_QUANTIFIERELIM_APPLICATIONS: 101, TOOLS_QUANTIFIERELIM_TIME[ms]: 833, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 63, FLUID_QUERY_TIME[ms]: 7, FLUID_QUERIES: 83, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 94, DOMAIN_JOIN_TIME[ms]: 1013, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME[ms]: 39, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME[ms]: 23, DOMAIN_ISBOTTOM_APPLICATIONS: 16, DOMAIN_ISBOTTOM_TIME[ms]: 25, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 145, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 144, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 28, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME[ms]: 125, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 125, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 5, PATH_EXPR_TIME[ms]: 7, REGEX_TO_DAG_TIME[ms]: 4, DAG_COMPRESSION_TIME[ms]: 38, DAG_COMPRESSION_PROCESSED_NODES: 206, DAG_COMPRESSION_RETAINED_NODES: 104, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
Received shutdown request...