/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1131a.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:13:20,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:13:20,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:13:20,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:13:20,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:13:20,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:13:20,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:13:20,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:13:20,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:13:20,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:13:20,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:13:20,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:13:20,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:13:20,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:13:20,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:13:20,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:13:20,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:13:20,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:13:20,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:13:20,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:13:20,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:13:20,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:13:20,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:13:20,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:13:20,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:13:20,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:13:20,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:13:20,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:13:20,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:13:20,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:13:20,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:13:20,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:13:20,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:13:20,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:13:20,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:13:20,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:13:20,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:13:20,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:13:20,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:13:20,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:13:20,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:13:20,538 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:13:20,549 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:13:20,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:13:20,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:13:20,552 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:13:20,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:13:20,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:13:20,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:13:20,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:13:20,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:13:20,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:13:20,554 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:13:20,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:13:20,555 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:13:20,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:13:20,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:13:20,556 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:13:20,556 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:13:20,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:13:20,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:13:20,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:13:20,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:13:20,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:13:20,557 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:13:20,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:13:20,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:13:20,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:13:20,881 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:13:20,882 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:13:20,882 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1131a.c [2020-07-18 00:13:20,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28be74fa6/43f8c5c5d332465a854d477cdb88985b/FLAGd1d656f0b [2020-07-18 00:13:21,416 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:13:21,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1131a.c [2020-07-18 00:13:21,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28be74fa6/43f8c5c5d332465a854d477cdb88985b/FLAGd1d656f0b [2020-07-18 00:13:21,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28be74fa6/43f8c5c5d332465a854d477cdb88985b [2020-07-18 00:13:21,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:13:21,820 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:13:21,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:13:21,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:13:21,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:13:21,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:13:21" (1/1) ... [2020-07-18 00:13:21,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63334ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:21, skipping insertion in model container [2020-07-18 00:13:21,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:13:21" (1/1) ... [2020-07-18 00:13:21,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:13:21,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:13:22,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:13:22,140 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:13:22,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:13:22,314 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:13:22,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:22 WrapperNode [2020-07-18 00:13:22,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:13:22,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:13:22,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:13:22,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:13:22,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:22" (1/1) ... [2020-07-18 00:13:22,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:22" (1/1) ... [2020-07-18 00:13:22,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:22" (1/1) ... [2020-07-18 00:13:22,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:22" (1/1) ... [2020-07-18 00:13:22,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:22" (1/1) ... [2020-07-18 00:13:22,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:22" (1/1) ... [2020-07-18 00:13:22,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:22" (1/1) ... [2020-07-18 00:13:22,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:13:22,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:13:22,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:13:22,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:13:22,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:22" (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-18 00:13:22,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:13:22,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:13:22,459 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-18 00:13:22,459 INFO L138 BoogieDeclarations]: Found implementation of procedure fmod_double [2020-07-18 00:13:22,459 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_double [2020-07-18 00:13:22,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:13:22,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:13:22,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-18 00:13:22,460 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-18 00:13:22,460 INFO L130 BoogieDeclarations]: Found specification of procedure fmod_double [2020-07-18 00:13:22,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:13:22,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-18 00:13:22,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:13:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:13:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-18 00:13:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:13:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_double [2020-07-18 00:13:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:13:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:13:22,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2020-07-18 00:13:22,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:13:23,454 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:13:23,457 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-07-18 00:13:23,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:13:23 BoogieIcfgContainer [2020-07-18 00:13:23,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:13:23,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:13:23,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:13:23,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:13:23,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:13:21" (1/3) ... [2020-07-18 00:13:23,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b48c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:13:23, skipping insertion in model container [2020-07-18 00:13:23,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:22" (2/3) ... [2020-07-18 00:13:23,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b48c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:13:23, skipping insertion in model container [2020-07-18 00:13:23,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:13:23" (3/3) ... [2020-07-18 00:13:23,478 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1131a.c [2020-07-18 00:13:23,489 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:13:23,497 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:13:23,510 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:13:23,529 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:13:23,529 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:13:23,529 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:13:23,529 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:13:23,530 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:13:23,530 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:13:23,530 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:13:23,530 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:13:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2020-07-18 00:13:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-18 00:13:23,561 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:23,562 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, 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-18 00:13:23,562 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:23,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:23,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1076720203, now seen corresponding path program 1 times [2020-07-18 00:13:23,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:23,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1455637333] [2020-07-18 00:13:23,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:23,857 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#(and (= ~one_fmod~0 |old(~one_fmod~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#Zero_fmod~0.base| |old(~#Zero_fmod~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#Zero_fmod~0.offset| |old(~#Zero_fmod~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {219#true} is VALID [2020-07-18 00:13:23,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {219#true} #valid := #valid[0 := 0]; {219#true} is VALID [2020-07-18 00:13:23,859 INFO L280 TraceCheckUtils]: 2: Hoare triple {219#true} assume 0 < #StackHeapBarrier; {219#true} is VALID [2020-07-18 00:13:23,860 INFO L280 TraceCheckUtils]: 3: Hoare triple {219#true} ~one_fmod~0 := 1.0; {219#true} is VALID [2020-07-18 00:13:23,861 INFO L280 TraceCheckUtils]: 4: Hoare triple {219#true} SUMMARY for call ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := #Ultimate.allocOnStack(16); srcloc: L18-1 {219#true} is VALID [2020-07-18 00:13:23,862 INFO L280 TraceCheckUtils]: 5: Hoare triple {219#true} SUMMARY for call write~init~real(0.0, ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 8); srcloc: L18-2 {219#true} is VALID [2020-07-18 00:13:23,862 INFO L280 TraceCheckUtils]: 6: Hoare triple {219#true} SUMMARY for call write~init~real(~someUnaryDOUBLEoperation(0.0), ~#Zero_fmod~0.base, 8 + ~#Zero_fmod~0.offset, 8); srcloc: L18-3 {219#true} is VALID [2020-07-18 00:13:23,862 INFO L280 TraceCheckUtils]: 7: Hoare triple {219#true} assume true; {219#true} is VALID [2020-07-18 00:13:23,863 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {219#true} {219#true} #431#return; {219#true} is VALID [2020-07-18 00:13:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:23,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {259#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {219#true} is VALID [2020-07-18 00:13:23,903 INFO L280 TraceCheckUtils]: 1: Hoare triple {219#true} havoc ~hx~1; {219#true} is VALID [2020-07-18 00:13:23,904 INFO L280 TraceCheckUtils]: 2: Hoare triple {219#true} assume !true; {220#false} is VALID [2020-07-18 00:13:23,904 INFO L280 TraceCheckUtils]: 3: Hoare triple {220#false} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {220#false} is VALID [2020-07-18 00:13:23,905 INFO L280 TraceCheckUtils]: 4: Hoare triple {220#false} assume true; {220#false} is VALID [2020-07-18 00:13:23,905 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {220#false} {219#true} #427#return; {220#false} is VALID [2020-07-18 00:13:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:23,933 INFO L280 TraceCheckUtils]: 0: Hoare triple {259#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {219#true} is VALID [2020-07-18 00:13:23,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {219#true} ~y := #in~y; {219#true} is VALID [2020-07-18 00:13:23,934 INFO L280 TraceCheckUtils]: 2: Hoare triple {219#true} havoc ~n~0; {219#true} is VALID [2020-07-18 00:13:23,935 INFO L280 TraceCheckUtils]: 3: Hoare triple {219#true} havoc ~hx~0; {219#true} is VALID [2020-07-18 00:13:23,935 INFO L280 TraceCheckUtils]: 4: Hoare triple {219#true} havoc ~hy~0; {219#true} is VALID [2020-07-18 00:13:23,935 INFO L280 TraceCheckUtils]: 5: Hoare triple {219#true} havoc ~hz~0; {219#true} is VALID [2020-07-18 00:13:23,936 INFO L280 TraceCheckUtils]: 6: Hoare triple {219#true} havoc ~ix~0; {219#true} is VALID [2020-07-18 00:13:23,936 INFO L280 TraceCheckUtils]: 7: Hoare triple {219#true} havoc ~iy~0; {219#true} is VALID [2020-07-18 00:13:23,936 INFO L280 TraceCheckUtils]: 8: Hoare triple {219#true} havoc ~sx~0; {219#true} is VALID [2020-07-18 00:13:23,937 INFO L280 TraceCheckUtils]: 9: Hoare triple {219#true} havoc ~i~0; {219#true} is VALID [2020-07-18 00:13:23,937 INFO L280 TraceCheckUtils]: 10: Hoare triple {219#true} havoc ~lx~0; {219#true} is VALID [2020-07-18 00:13:23,938 INFO L280 TraceCheckUtils]: 11: Hoare triple {219#true} havoc ~ly~0; {219#true} is VALID [2020-07-18 00:13:23,938 INFO L280 TraceCheckUtils]: 12: Hoare triple {219#true} havoc ~lz~0; {219#true} is VALID [2020-07-18 00:13:23,939 INFO L280 TraceCheckUtils]: 13: Hoare triple {219#true} assume !true; {220#false} is VALID [2020-07-18 00:13:23,940 INFO L280 TraceCheckUtils]: 14: Hoare triple {220#false} assume !true; {220#false} is VALID [2020-07-18 00:13:23,940 INFO L280 TraceCheckUtils]: 15: Hoare triple {220#false} ~sx~0 := (if ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); {220#false} is VALID [2020-07-18 00:13:23,941 INFO L280 TraceCheckUtils]: 16: Hoare triple {220#false} ~hx~0 := ~bitwiseXor(~hx~0, ~sx~0); {220#false} is VALID [2020-07-18 00:13:23,941 INFO L280 TraceCheckUtils]: 17: Hoare triple {220#false} ~hy~0 := ~bitwiseAnd(~hy~0, 2147483647); {220#false} is VALID [2020-07-18 00:13:23,941 INFO L280 TraceCheckUtils]: 18: Hoare triple {220#false} assume (0 == ~bitwiseOr(~hy~0, ~ly~0) % 4294967296 || ~hx~0 >= 2146435072) || ~bitwiseOr(~hy~0, ~bitwiseOr(~ly~0, -~ly~0) / 2147483648) % 4294967296 > 2146435072; {220#false} is VALID [2020-07-18 00:13:23,942 INFO L280 TraceCheckUtils]: 19: Hoare triple {220#false} #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~y), ~someBinaryArithmeticDOUBLEoperation(~x, ~y)); {220#false} is VALID [2020-07-18 00:13:23,942 INFO L280 TraceCheckUtils]: 20: Hoare triple {220#false} assume true; {220#false} is VALID [2020-07-18 00:13:23,942 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {220#false} {220#false} #429#return; {220#false} is VALID [2020-07-18 00:13:23,949 INFO L263 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {258#(and (= ~one_fmod~0 |old(~one_fmod~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#Zero_fmod~0.base| |old(~#Zero_fmod~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#Zero_fmod~0.offset| |old(~#Zero_fmod~0.offset)|))} is VALID [2020-07-18 00:13:23,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {258#(and (= ~one_fmod~0 |old(~one_fmod~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#Zero_fmod~0.base| |old(~#Zero_fmod~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#Zero_fmod~0.offset| |old(~#Zero_fmod~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {219#true} is VALID [2020-07-18 00:13:23,950 INFO L280 TraceCheckUtils]: 2: Hoare triple {219#true} #valid := #valid[0 := 0]; {219#true} is VALID [2020-07-18 00:13:23,950 INFO L280 TraceCheckUtils]: 3: Hoare triple {219#true} assume 0 < #StackHeapBarrier; {219#true} is VALID [2020-07-18 00:13:23,950 INFO L280 TraceCheckUtils]: 4: Hoare triple {219#true} ~one_fmod~0 := 1.0; {219#true} is VALID [2020-07-18 00:13:23,951 INFO L280 TraceCheckUtils]: 5: Hoare triple {219#true} SUMMARY for call ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := #Ultimate.allocOnStack(16); srcloc: L18-1 {219#true} is VALID [2020-07-18 00:13:23,951 INFO L280 TraceCheckUtils]: 6: Hoare triple {219#true} SUMMARY for call write~init~real(0.0, ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 8); srcloc: L18-2 {219#true} is VALID [2020-07-18 00:13:23,951 INFO L280 TraceCheckUtils]: 7: Hoare triple {219#true} SUMMARY for call write~init~real(~someUnaryDOUBLEoperation(0.0), ~#Zero_fmod~0.base, 8 + ~#Zero_fmod~0.offset, 8); srcloc: L18-3 {219#true} is VALID [2020-07-18 00:13:23,952 INFO L280 TraceCheckUtils]: 8: Hoare triple {219#true} assume true; {219#true} is VALID [2020-07-18 00:13:23,952 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {219#true} {219#true} #431#return; {219#true} is VALID [2020-07-18 00:13:23,952 INFO L263 TraceCheckUtils]: 10: Hoare triple {219#true} call #t~ret21 := main(); {219#true} is VALID [2020-07-18 00:13:23,953 INFO L280 TraceCheckUtils]: 11: Hoare triple {219#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); {219#true} is VALID [2020-07-18 00:13:23,953 INFO L280 TraceCheckUtils]: 12: Hoare triple {219#true} ~x~0 := #t~nondet18; {219#true} is VALID [2020-07-18 00:13:23,953 INFO L280 TraceCheckUtils]: 13: Hoare triple {219#true} havoc #t~nondet18; {219#true} is VALID [2020-07-18 00:13:23,955 INFO L263 TraceCheckUtils]: 14: Hoare triple {219#true} call #t~ret19 := isfinite_double(~x~0); {259#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:13:23,955 INFO L280 TraceCheckUtils]: 15: Hoare triple {259#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {219#true} is VALID [2020-07-18 00:13:23,956 INFO L280 TraceCheckUtils]: 16: Hoare triple {219#true} havoc ~hx~1; {219#true} is VALID [2020-07-18 00:13:23,956 INFO L280 TraceCheckUtils]: 17: Hoare triple {219#true} assume !true; {220#false} is VALID [2020-07-18 00:13:23,957 INFO L280 TraceCheckUtils]: 18: Hoare triple {220#false} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {220#false} is VALID [2020-07-18 00:13:23,957 INFO L280 TraceCheckUtils]: 19: Hoare triple {220#false} assume true; {220#false} is VALID [2020-07-18 00:13:23,957 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {220#false} {219#true} #427#return; {220#false} is VALID [2020-07-18 00:13:23,958 INFO L280 TraceCheckUtils]: 21: Hoare triple {220#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647; {220#false} is VALID [2020-07-18 00:13:23,958 INFO L280 TraceCheckUtils]: 22: Hoare triple {220#false} assume 0 != #t~ret19; {220#false} is VALID [2020-07-18 00:13:23,959 INFO L280 TraceCheckUtils]: 23: Hoare triple {220#false} havoc #t~ret19; {220#false} is VALID [2020-07-18 00:13:23,959 INFO L263 TraceCheckUtils]: 24: Hoare triple {220#false} call #t~ret20 := fmod_double(~x~0, ~y~0); {259#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:13:23,959 INFO L280 TraceCheckUtils]: 25: Hoare triple {259#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {219#true} is VALID [2020-07-18 00:13:23,960 INFO L280 TraceCheckUtils]: 26: Hoare triple {219#true} ~y := #in~y; {219#true} is VALID [2020-07-18 00:13:23,960 INFO L280 TraceCheckUtils]: 27: Hoare triple {219#true} havoc ~n~0; {219#true} is VALID [2020-07-18 00:13:23,960 INFO L280 TraceCheckUtils]: 28: Hoare triple {219#true} havoc ~hx~0; {219#true} is VALID [2020-07-18 00:13:23,961 INFO L280 TraceCheckUtils]: 29: Hoare triple {219#true} havoc ~hy~0; {219#true} is VALID [2020-07-18 00:13:23,961 INFO L280 TraceCheckUtils]: 30: Hoare triple {219#true} havoc ~hz~0; {219#true} is VALID [2020-07-18 00:13:23,961 INFO L280 TraceCheckUtils]: 31: Hoare triple {219#true} havoc ~ix~0; {219#true} is VALID [2020-07-18 00:13:23,961 INFO L280 TraceCheckUtils]: 32: Hoare triple {219#true} havoc ~iy~0; {219#true} is VALID [2020-07-18 00:13:23,962 INFO L280 TraceCheckUtils]: 33: Hoare triple {219#true} havoc ~sx~0; {219#true} is VALID [2020-07-18 00:13:23,962 INFO L280 TraceCheckUtils]: 34: Hoare triple {219#true} havoc ~i~0; {219#true} is VALID [2020-07-18 00:13:23,962 INFO L280 TraceCheckUtils]: 35: Hoare triple {219#true} havoc ~lx~0; {219#true} is VALID [2020-07-18 00:13:23,963 INFO L280 TraceCheckUtils]: 36: Hoare triple {219#true} havoc ~ly~0; {219#true} is VALID [2020-07-18 00:13:23,963 INFO L280 TraceCheckUtils]: 37: Hoare triple {219#true} havoc ~lz~0; {219#true} is VALID [2020-07-18 00:13:23,964 INFO L280 TraceCheckUtils]: 38: Hoare triple {219#true} assume !true; {220#false} is VALID [2020-07-18 00:13:23,964 INFO L280 TraceCheckUtils]: 39: Hoare triple {220#false} assume !true; {220#false} is VALID [2020-07-18 00:13:23,965 INFO L280 TraceCheckUtils]: 40: Hoare triple {220#false} ~sx~0 := (if ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); {220#false} is VALID [2020-07-18 00:13:23,965 INFO L280 TraceCheckUtils]: 41: Hoare triple {220#false} ~hx~0 := ~bitwiseXor(~hx~0, ~sx~0); {220#false} is VALID [2020-07-18 00:13:23,965 INFO L280 TraceCheckUtils]: 42: Hoare triple {220#false} ~hy~0 := ~bitwiseAnd(~hy~0, 2147483647); {220#false} is VALID [2020-07-18 00:13:23,966 INFO L280 TraceCheckUtils]: 43: Hoare triple {220#false} assume (0 == ~bitwiseOr(~hy~0, ~ly~0) % 4294967296 || ~hx~0 >= 2146435072) || ~bitwiseOr(~hy~0, ~bitwiseOr(~ly~0, -~ly~0) / 2147483648) % 4294967296 > 2146435072; {220#false} is VALID [2020-07-18 00:13:23,966 INFO L280 TraceCheckUtils]: 44: Hoare triple {220#false} #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~y), ~someBinaryArithmeticDOUBLEoperation(~x, ~y)); {220#false} is VALID [2020-07-18 00:13:23,966 INFO L280 TraceCheckUtils]: 45: Hoare triple {220#false} assume true; {220#false} is VALID [2020-07-18 00:13:23,967 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {220#false} {220#false} #429#return; {220#false} is VALID [2020-07-18 00:13:23,967 INFO L280 TraceCheckUtils]: 47: Hoare triple {220#false} ~res~0 := #t~ret20; {220#false} is VALID [2020-07-18 00:13:23,967 INFO L280 TraceCheckUtils]: 48: Hoare triple {220#false} havoc #t~ret20; {220#false} is VALID [2020-07-18 00:13:23,968 INFO L280 TraceCheckUtils]: 49: Hoare triple {220#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {220#false} is VALID [2020-07-18 00:13:23,968 INFO L280 TraceCheckUtils]: 50: Hoare triple {220#false} assume !false; {220#false} is VALID [2020-07-18 00:13:23,973 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-18 00:13:23,975 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:13:23,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1455637333] [2020-07-18 00:13:23,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:13:23,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:13:23,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766609219] [2020-07-18 00:13:23,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-07-18 00:13:23,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:13:23,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:13:24,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:13:24,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:13:24,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:13:24,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:13:24,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:13:24,083 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2020-07-18 00:13:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:25,578 INFO L93 Difference]: Finished difference Result 414 states and 503 transitions. [2020-07-18 00:13:25,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:13:25,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-07-18 00:13:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:13:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:13:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2020-07-18 00:13:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:13:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2020-07-18 00:13:25,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 503 transitions. [2020-07-18 00:13:26,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 503 edges. 503 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:13:26,243 INFO L225 Difference]: With dead ends: 414 [2020-07-18 00:13:26,243 INFO L226 Difference]: Without dead ends: 209 [2020-07-18 00:13:26,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:13:26,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-07-18 00:13:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-07-18 00:13:26,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:13:26,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 209 states. [2020-07-18 00:13:26,465 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 209 states. [2020-07-18 00:13:26,465 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 209 states. [2020-07-18 00:13:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:26,485 INFO L93 Difference]: Finished difference Result 209 states and 235 transitions. [2020-07-18 00:13:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 235 transitions. [2020-07-18 00:13:26,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:26,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:26,489 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 209 states. [2020-07-18 00:13:26,489 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 209 states. [2020-07-18 00:13:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:26,507 INFO L93 Difference]: Finished difference Result 209 states and 235 transitions. [2020-07-18 00:13:26,508 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 235 transitions. [2020-07-18 00:13:26,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:26,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:26,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:13:26,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:13:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-07-18 00:13:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 235 transitions. [2020-07-18 00:13:26,528 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 235 transitions. Word has length 51 [2020-07-18 00:13:26,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:13:26,529 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 235 transitions. [2020-07-18 00:13:26,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:13:26,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 209 states and 235 transitions. [2020-07-18 00:13:26,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:13:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 235 transitions. [2020-07-18 00:13:26,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-07-18 00:13:26,800 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:26,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 00:13:26,800 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:13:26,801 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:26,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:26,801 INFO L82 PathProgramCache]: Analyzing trace with hash -484158952, now seen corresponding path program 1 times [2020-07-18 00:13:26,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:26,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [965747120] [2020-07-18 00:13:26,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:26,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:13:26,998 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:214) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:283) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:13:27,004 INFO L168 Benchmark]: Toolchain (without parser) took 5185.67 ms. Allocated memory was 143.7 MB in the beginning and 285.2 MB in the end (delta: 141.6 MB). Free memory was 101.7 MB in the beginning and 192.9 MB in the end (delta: -91.1 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:27,005 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 143.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 00:13:27,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.46 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 101.5 MB in the beginning and 176.3 MB in the end (delta: -74.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:27,007 INFO L168 Benchmark]: Boogie Preprocessor took 76.53 ms. Allocated memory is still 201.9 MB. Free memory was 176.3 MB in the beginning and 172.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:27,008 INFO L168 Benchmark]: RCFGBuilder took 1074.56 ms. Allocated memory was 201.9 MB in the beginning and 234.4 MB in the end (delta: 32.5 MB). Free memory was 172.8 MB in the beginning and 208.0 MB in the end (delta: -35.1 MB). Peak memory consumption was 89.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:27,009 INFO L168 Benchmark]: TraceAbstraction took 3532.19 ms. Allocated memory was 234.4 MB in the beginning and 285.2 MB in the end (delta: 50.9 MB). Free memory was 206.6 MB in the beginning and 192.9 MB in the end (delta: 13.7 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:27,013 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.23 ms. Allocated memory is still 143.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 494.46 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 101.5 MB in the beginning and 176.3 MB in the end (delta: -74.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.53 ms. Allocated memory is still 201.9 MB. Free memory was 176.3 MB in the beginning and 172.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1074.56 ms. Allocated memory was 201.9 MB in the beginning and 234.4 MB in the end (delta: 32.5 MB). Free memory was 172.8 MB in the beginning and 208.0 MB in the end (delta: -35.1 MB). Peak memory consumption was 89.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3532.19 ms. Allocated memory was 234.4 MB in the beginning and 285.2 MB in the end (delta: 50.9 MB). Free memory was 206.6 MB in the beginning and 192.9 MB in the end (delta: 13.7 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...