/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-newlib/double_req_bl_1121a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 12:01:46,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 12:01:46,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 12:01:46,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 12:01:46,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 12:01:46,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 12:01:46,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 12:01:46,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 12:01:46,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 12:01:46,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 12:01:46,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 12:01:46,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 12:01:46,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 12:01:46,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 12:01:46,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 12:01:46,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 12:01:46,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 12:01:46,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 12:01:46,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 12:01:46,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 12:01:46,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 12:01:46,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 12:01:46,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 12:01:46,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 12:01:46,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 12:01:46,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 12:01:46,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 12:01:46,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 12:01:46,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 12:01:46,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 12:01:46,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 12:01:46,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 12:01:46,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 12:01:46,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 12:01:46,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 12:01:46,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 12:01:46,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 12:01:46,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 12:01:46,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 12:01:46,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 12:01:46,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 12:01:46,607 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 12:01:46,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 12:01:46,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 12:01:46,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 12:01:46,662 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 12:01:46,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 12:01:46,664 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 12:01:46,667 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 12:01:46,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 12:01:46,668 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 12:01:46,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 12:01:46,669 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 12:01:46,670 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 12:01:46,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 12:01:46,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 12:01:46,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 12:01:46,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 12:01:46,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 12:01:46,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 12:01:46,671 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 12:01:46,671 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 12:01:46,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 12:01:46,672 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 12:01:46,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 12:01:46,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 12:01:46,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 12:01:46,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 12:01:46,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:01:46,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 12:01:46,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 12:01:46,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 12:01:46,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 12:01:46,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 12:01:46,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 12:01:46,674 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 12:01:47,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 12:01:47,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 12:01:47,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 12:01:47,138 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 12:01:47,139 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 12:01:47,140 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1121a.c [2022-10-16 12:01:47,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8516f23/37bf19bf98be4949befac50c2da06511/FLAGbcbdfbe7c [2022-10-16 12:01:47,926 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 12:01:47,926 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1121a.c [2022-10-16 12:01:47,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8516f23/37bf19bf98be4949befac50c2da06511/FLAGbcbdfbe7c [2022-10-16 12:01:48,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8516f23/37bf19bf98be4949befac50c2da06511 [2022-10-16 12:01:48,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 12:01:48,275 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 12:01:48,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 12:01:48,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 12:01:48,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 12:01:48,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:01:48" (1/1) ... [2022-10-16 12:01:48,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@951a71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48, skipping insertion in model container [2022-10-16 12:01:48,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:01:48" (1/1) ... [2022-10-16 12:01:48,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 12:01:48,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 12:01:48,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1121a.c[3883,3896] [2022-10-16 12:01:48,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:01:48,789 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 12:01:48,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1121a.c[3883,3896] [2022-10-16 12:01:48,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:01:48,932 INFO L208 MainTranslator]: Completed translation [2022-10-16 12:01:48,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48 WrapperNode [2022-10-16 12:01:48,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 12:01:48,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 12:01:48,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 12:01:48,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 12:01:48,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48" (1/1) ... [2022-10-16 12:01:48,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48" (1/1) ... [2022-10-16 12:01:49,053 INFO L138 Inliner]: procedures = 18, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 380 [2022-10-16 12:01:49,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 12:01:49,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 12:01:49,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 12:01:49,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 12:01:49,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48" (1/1) ... [2022-10-16 12:01:49,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48" (1/1) ... [2022-10-16 12:01:49,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48" (1/1) ... [2022-10-16 12:01:49,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48" (1/1) ... [2022-10-16 12:01:49,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48" (1/1) ... [2022-10-16 12:01:49,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48" (1/1) ... [2022-10-16 12:01:49,108 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48" (1/1) ... [2022-10-16 12:01:49,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48" (1/1) ... [2022-10-16 12:01:49,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 12:01:49,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 12:01:49,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 12:01:49,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 12:01:49,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48" (1/1) ... [2022-10-16 12:01:49,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:01:49,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:01:49,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 12:01:49,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 12:01:49,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 12:01:49,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 12:01:49,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 12:01:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 12:01:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 12:01:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 12:01:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 12:01:49,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 12:01:49,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 12:01:49,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-16 12:01:49,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 12:01:49,331 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 12:01:49,334 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 12:01:50,333 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 12:01:50,343 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 12:01:50,344 INFO L300 CfgBuilder]: Removed 14 assume(true) statements. [2022-10-16 12:01:50,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:01:50 BoogieIcfgContainer [2022-10-16 12:01:50,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 12:01:50,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 12:01:50,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 12:01:50,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 12:01:50,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:01:48" (1/3) ... [2022-10-16 12:01:50,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af6d995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:01:50, skipping insertion in model container [2022-10-16 12:01:50,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:48" (2/3) ... [2022-10-16 12:01:50,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af6d995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:01:50, skipping insertion in model container [2022-10-16 12:01:50,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:01:50" (3/3) ... [2022-10-16 12:01:50,357 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1121a.c [2022-10-16 12:01:50,379 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 12:01:50,379 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 74 error locations. [2022-10-16 12:01:50,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 12:01:50,458 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@35c562e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 12:01:50,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2022-10-16 12:01:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 156 states have (on average 1.9230769230769231) internal successors, (300), 230 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:50,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 12:01:50,473 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:50,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:50,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2022-10-16 12:01:50,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:50,481 INFO L85 PathProgramCache]: Analyzing trace with hash 736695697, now seen corresponding path program 1 times [2022-10-16 12:01:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:50,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242017921] [2022-10-16 12:01:50,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:50,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:50,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:50,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242017921] [2022-10-16 12:01:50,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242017921] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:50,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:50,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:50,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152851631] [2022-10-16 12:01:50,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:50,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 12:01:50,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:50,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 12:01:50,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:01:50,755 INFO L87 Difference]: Start difference. First operand has 231 states, 156 states have (on average 1.9230769230769231) internal successors, (300), 230 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:50,835 INFO L93 Difference]: Finished difference Result 460 states and 598 transitions. [2022-10-16 12:01:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 12:01:50,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-16 12:01:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:50,860 INFO L225 Difference]: With dead ends: 460 [2022-10-16 12:01:50,861 INFO L226 Difference]: Without dead ends: 209 [2022-10-16 12:01:50,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:01:50,877 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:50,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:01:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-10-16 12:01:50,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-10-16 12:01:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 135 states have (on average 1.7703703703703704) internal successors, (239), 208 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:50,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 239 transitions. [2022-10-16 12:01:50,962 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 239 transitions. Word has length 10 [2022-10-16 12:01:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:50,962 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 239 transitions. [2022-10-16 12:01:50,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 239 transitions. [2022-10-16 12:01:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 12:01:50,964 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:50,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:50,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 12:01:50,967 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2022-10-16 12:01:50,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:50,968 INFO L85 PathProgramCache]: Analyzing trace with hash 201256782, now seen corresponding path program 1 times [2022-10-16 12:01:50,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:50,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122656268] [2022-10-16 12:01:50,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:50,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:51,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:51,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122656268] [2022-10-16 12:01:51,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122656268] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:51,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:51,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:01:51,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993438936] [2022-10-16 12:01:51,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:51,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:01:51,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:51,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:01:51,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:01:51,472 INFO L87 Difference]: Start difference. First operand 209 states and 239 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:51,847 INFO L93 Difference]: Finished difference Result 658 states and 772 transitions. [2022-10-16 12:01:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:01:51,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 12:01:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:51,856 INFO L225 Difference]: With dead ends: 658 [2022-10-16 12:01:51,856 INFO L226 Difference]: Without dead ends: 464 [2022-10-16 12:01:51,861 INFO L412 NwaCegarLoop]: 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 [2022-10-16 12:01:51,865 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 295 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:51,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 785 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 12:01:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-10-16 12:01:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 290. [2022-10-16 12:01:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 216 states have (on average 1.7592592592592593) internal successors, (380), 289 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 380 transitions. [2022-10-16 12:01:51,918 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 380 transitions. Word has length 12 [2022-10-16 12:01:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:51,918 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 380 transitions. [2022-10-16 12:01:51,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 380 transitions. [2022-10-16 12:01:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 12:01:51,922 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:51,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:51,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 12:01:51,923 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2022-10-16 12:01:51,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash 132859889, now seen corresponding path program 1 times [2022-10-16 12:01:51,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:51,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063841127] [2022-10-16 12:01:51,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:51,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:52,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:52,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063841127] [2022-10-16 12:01:52,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063841127] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:52,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:52,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:52,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229399851] [2022-10-16 12:01:52,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:52,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:52,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:52,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:52,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:52,071 INFO L87 Difference]: Start difference. First operand 290 states and 380 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:52,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:52,115 INFO L93 Difference]: Finished difference Result 429 states and 516 transitions. [2022-10-16 12:01:52,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:52,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 12:01:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:52,119 INFO L225 Difference]: With dead ends: 429 [2022-10-16 12:01:52,119 INFO L226 Difference]: Without dead ends: 427 [2022-10-16 12:01:52,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:52,129 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 192 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:52,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 441 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:01:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-10-16 12:01:52,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 289. [2022-10-16 12:01:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 216 states have (on average 1.75) internal successors, (378), 288 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 378 transitions. [2022-10-16 12:01:52,156 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 378 transitions. Word has length 14 [2022-10-16 12:01:52,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:52,156 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 378 transitions. [2022-10-16 12:01:52,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 378 transitions. [2022-10-16 12:01:52,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:01:52,158 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:52,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:52,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 12:01:52,158 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2022-10-16 12:01:52,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:52,160 INFO L85 PathProgramCache]: Analyzing trace with hash -176309823, now seen corresponding path program 1 times [2022-10-16 12:01:52,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:52,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916934772] [2022-10-16 12:01:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:52,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:52,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:52,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916934772] [2022-10-16 12:01:52,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916934772] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:52,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:52,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 12:01:52,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442432464] [2022-10-16 12:01:52,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:52,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 12:01:52,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:52,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 12:01:52,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:01:52,352 INFO L87 Difference]: Start difference. First operand 289 states and 378 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:52,648 INFO L93 Difference]: Finished difference Result 893 states and 1057 transitions. [2022-10-16 12:01:52,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:01:52,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-16 12:01:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:52,653 INFO L225 Difference]: With dead ends: 893 [2022-10-16 12:01:52,653 INFO L226 Difference]: Without dead ends: 691 [2022-10-16 12:01:52,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:01:52,655 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 962 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:52,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 846 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 12:01:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-10-16 12:01:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 347. [2022-10-16 12:01:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 274 states have (on average 1.7372262773722629) internal successors, (476), 346 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 476 transitions. [2022-10-16 12:01:52,672 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 476 transitions. Word has length 15 [2022-10-16 12:01:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:52,672 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 476 transitions. [2022-10-16 12:01:52,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 476 transitions. [2022-10-16 12:01:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:01:52,674 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:52,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:52,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 12:01:52,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2022-10-16 12:01:52,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:52,675 INFO L85 PathProgramCache]: Analyzing trace with hash -176310621, now seen corresponding path program 1 times [2022-10-16 12:01:52,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:52,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313147592] [2022-10-16 12:01:52,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:52,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:52,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:52,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313147592] [2022-10-16 12:01:52,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313147592] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:52,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:52,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295616402] [2022-10-16 12:01:52,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:52,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:52,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:52,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:52,737 INFO L87 Difference]: Start difference. First operand 347 states and 476 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:52,783 INFO L93 Difference]: Finished difference Result 651 states and 904 transitions. [2022-10-16 12:01:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:52,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-16 12:01:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:52,787 INFO L225 Difference]: With dead ends: 651 [2022-10-16 12:01:52,787 INFO L226 Difference]: Without dead ends: 648 [2022-10-16 12:01:52,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:52,789 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 201 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:52,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 434 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:01:52,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-10-16 12:01:52,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 398. [2022-10-16 12:01:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 325 states have (on average 1.7230769230769232) internal successors, (560), 397 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 560 transitions. [2022-10-16 12:01:52,817 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 560 transitions. Word has length 15 [2022-10-16 12:01:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:52,818 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 560 transitions. [2022-10-16 12:01:52,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 560 transitions. [2022-10-16 12:01:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:01:52,819 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:52,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:52,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 12:01:52,820 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2022-10-16 12:01:52,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:52,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1705182292, now seen corresponding path program 1 times [2022-10-16 12:01:52,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:52,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121556237] [2022-10-16 12:01:52,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:52,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:52,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:52,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:52,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121556237] [2022-10-16 12:01:52,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121556237] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:52,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:52,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:52,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115920412] [2022-10-16 12:01:52,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:52,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:52,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:52,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:52,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:52,883 INFO L87 Difference]: Start difference. First operand 398 states and 560 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:52,971 INFO L93 Difference]: Finished difference Result 508 states and 683 transitions. [2022-10-16 12:01:52,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:52,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-16 12:01:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:52,975 INFO L225 Difference]: With dead ends: 508 [2022-10-16 12:01:52,976 INFO L226 Difference]: Without dead ends: 506 [2022-10-16 12:01:52,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:52,977 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 203 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:52,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 430 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-10-16 12:01:52,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 435. [2022-10-16 12:01:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 363 states have (on average 1.7272727272727273) internal successors, (627), 434 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 627 transitions. [2022-10-16 12:01:52,994 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 627 transitions. Word has length 15 [2022-10-16 12:01:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:52,995 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 627 transitions. [2022-10-16 12:01:52,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 627 transitions. [2022-10-16 12:01:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 12:01:52,996 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:52,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:52,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 12:01:52,997 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2022-10-16 12:01:52,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:52,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1321043350, now seen corresponding path program 1 times [2022-10-16 12:01:52,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:52,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339550599] [2022-10-16 12:01:52,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:52,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:53,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:53,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339550599] [2022-10-16 12:01:53,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339550599] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:53,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:53,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:53,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86000049] [2022-10-16 12:01:53,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:53,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:53,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:53,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:53,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:53,064 INFO L87 Difference]: Start difference. First operand 435 states and 627 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:53,173 INFO L93 Difference]: Finished difference Result 606 states and 824 transitions. [2022-10-16 12:01:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:53,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-16 12:01:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:53,177 INFO L225 Difference]: With dead ends: 606 [2022-10-16 12:01:53,178 INFO L226 Difference]: Without dead ends: 556 [2022-10-16 12:01:53,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:53,179 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 174 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:53,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 501 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-10-16 12:01:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 508. [2022-10-16 12:01:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 438 states have (on average 1.7397260273972603) internal successors, (762), 507 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 762 transitions. [2022-10-16 12:01:53,203 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 762 transitions. Word has length 16 [2022-10-16 12:01:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:53,203 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 762 transitions. [2022-10-16 12:01:53,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 762 transitions. [2022-10-16 12:01:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 12:01:53,205 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:53,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:53,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 12:01:53,206 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2022-10-16 12:01:53,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1321087395, now seen corresponding path program 1 times [2022-10-16 12:01:53,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:53,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555951339] [2022-10-16 12:01:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:53,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:01:53,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:53,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555951339] [2022-10-16 12:01:53,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555951339] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:53,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:53,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:53,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024998749] [2022-10-16 12:01:53,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:53,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:53,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:53,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:53,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:53,254 INFO L87 Difference]: Start difference. First operand 508 states and 762 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:53,356 INFO L93 Difference]: Finished difference Result 603 states and 825 transitions. [2022-10-16 12:01:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:53,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-16 12:01:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:53,360 INFO L225 Difference]: With dead ends: 603 [2022-10-16 12:01:53,360 INFO L226 Difference]: Without dead ends: 563 [2022-10-16 12:01:53,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:53,362 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 155 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:53,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 468 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:01:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-10-16 12:01:53,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 513. [2022-10-16 12:01:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 445 states have (on average 1.7348314606741573) internal successors, (772), 512 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 772 transitions. [2022-10-16 12:01:53,382 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 772 transitions. Word has length 16 [2022-10-16 12:01:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:53,383 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 772 transitions. [2022-10-16 12:01:53,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:01:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 772 transitions. [2022-10-16 12:01:53,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 12:01:53,384 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:53,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:53,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 12:01:53,385 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 71 more)] === [2022-10-16 12:01:53,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:53,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1931374281, now seen corresponding path program 1 times [2022-10-16 12:01:53,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:53,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453883827] [2022-10-16 12:01:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:53,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:01:53,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 12:01:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:01:53,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 12:01:53,513 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 12:01:53,514 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 74 remaining) [2022-10-16 12:01:53,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 74 remaining) [2022-10-16 12:01:53,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 74 remaining) [2022-10-16 12:01:53,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 74 remaining) [2022-10-16 12:01:53,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 74 remaining) [2022-10-16 12:01:53,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 74 remaining) [2022-10-16 12:01:53,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 74 remaining) [2022-10-16 12:01:53,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 74 remaining) [2022-10-16 12:01:53,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 74 remaining) [2022-10-16 12:01:53,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 74 remaining) [2022-10-16 12:01:53,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 74 remaining) [2022-10-16 12:01:53,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 74 remaining) [2022-10-16 12:01:53,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 74 remaining) [2022-10-16 12:01:53,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 74 remaining) [2022-10-16 12:01:53,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 74 remaining) [2022-10-16 12:01:53,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 74 remaining) [2022-10-16 12:01:53,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 74 remaining) [2022-10-16 12:01:53,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 74 remaining) [2022-10-16 12:01:53,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 74 remaining) [2022-10-16 12:01:53,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 74 remaining) [2022-10-16 12:01:53,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 74 remaining) [2022-10-16 12:01:53,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 74 remaining) [2022-10-16 12:01:53,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 74 remaining) [2022-10-16 12:01:53,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 74 remaining) [2022-10-16 12:01:53,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 74 remaining) [2022-10-16 12:01:53,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 74 remaining) [2022-10-16 12:01:53,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 74 remaining) [2022-10-16 12:01:53,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 74 remaining) [2022-10-16 12:01:53,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 74 remaining) [2022-10-16 12:01:53,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 74 remaining) [2022-10-16 12:01:53,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 74 remaining) [2022-10-16 12:01:53,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 74 remaining) [2022-10-16 12:01:53,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 74 remaining) [2022-10-16 12:01:53,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 74 remaining) [2022-10-16 12:01:53,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 74 remaining) [2022-10-16 12:01:53,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 74 remaining) [2022-10-16 12:01:53,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 74 remaining) [2022-10-16 12:01:53,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 74 remaining) [2022-10-16 12:01:53,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 74 remaining) [2022-10-16 12:01:53,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 74 remaining) [2022-10-16 12:01:53,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 74 remaining) [2022-10-16 12:01:53,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 74 remaining) [2022-10-16 12:01:53,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 74 remaining) [2022-10-16 12:01:53,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 74 remaining) [2022-10-16 12:01:53,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 74 remaining) [2022-10-16 12:01:53,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 74 remaining) [2022-10-16 12:01:53,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 74 remaining) [2022-10-16 12:01:53,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 74 remaining) [2022-10-16 12:01:53,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 74 remaining) [2022-10-16 12:01:53,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 74 remaining) [2022-10-16 12:01:53,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 74 remaining) [2022-10-16 12:01:53,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 74 remaining) [2022-10-16 12:01:53,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 74 remaining) [2022-10-16 12:01:53,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 74 remaining) [2022-10-16 12:01:53,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 74 remaining) [2022-10-16 12:01:53,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 74 remaining) [2022-10-16 12:01:53,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 74 remaining) [2022-10-16 12:01:53,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 74 remaining) [2022-10-16 12:01:53,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 74 remaining) [2022-10-16 12:01:53,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 74 remaining) [2022-10-16 12:01:53,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 74 remaining) [2022-10-16 12:01:53,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 74 remaining) [2022-10-16 12:01:53,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 74 remaining) [2022-10-16 12:01:53,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 74 remaining) [2022-10-16 12:01:53,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 74 remaining) [2022-10-16 12:01:53,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 74 remaining) [2022-10-16 12:01:53,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 74 remaining) [2022-10-16 12:01:53,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 74 remaining) [2022-10-16 12:01:53,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 74 remaining) [2022-10-16 12:01:53,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 74 remaining) [2022-10-16 12:01:53,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 74 remaining) [2022-10-16 12:01:53,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 74 remaining) [2022-10-16 12:01:53,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 74 remaining) [2022-10-16 12:01:53,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 74 remaining) [2022-10-16 12:01:53,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 12:01:53,538 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:53,543 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 12:01:53,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:01:53 BoogieIcfgContainer [2022-10-16 12:01:53,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 12:01:53,585 INFO L158 Benchmark]: Toolchain (without parser) took 5314.14ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 128.1MB in the beginning and 61.8MB in the end (delta: 66.3MB). Peak memory consumption was 98.8MB. Max. memory is 8.0GB. [2022-10-16 12:01:53,586 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 155.2MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 12:01:53,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.66ms. Allocated memory is still 155.2MB. Free memory was 127.8MB in the beginning and 113.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-16 12:01:53,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.03ms. Allocated memory is still 155.2MB. Free memory was 113.7MB in the beginning and 108.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-16 12:01:53,587 INFO L158 Benchmark]: Boogie Preprocessor took 66.09ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 105.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-16 12:01:53,587 INFO L158 Benchmark]: RCFGBuilder took 1225.40ms. Allocated memory is still 155.2MB. Free memory was 105.4MB in the beginning and 103.6MB in the end (delta: 1.7MB). Peak memory consumption was 20.3MB. Max. memory is 8.0GB. [2022-10-16 12:01:53,588 INFO L158 Benchmark]: TraceAbstraction took 3235.18ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 103.1MB in the beginning and 61.8MB in the end (delta: 41.3MB). Peak memory consumption was 73.3MB. Max. memory is 8.0GB. [2022-10-16 12:01:53,590 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 155.2MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 656.66ms. Allocated memory is still 155.2MB. Free memory was 127.8MB in the beginning and 113.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 119.03ms. Allocated memory is still 155.2MB. Free memory was 113.7MB in the beginning and 108.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.09ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 105.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1225.40ms. Allocated memory is still 155.2MB. Free memory was 105.4MB in the beginning and 103.6MB in the end (delta: 1.7MB). Peak memory consumption was 20.3MB. Max. memory is 8.0GB. * TraceAbstraction took 3235.18ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 103.1MB in the beginning and 61.8MB in the end (delta: 41.3MB). Peak memory consumption was 73.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 46, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of bitwiseAnd at line 43, overapproximation of bitwiseXOr at line 42. Possible FailurePath: [L20-L23] static const double one_fmod = 1.0, Zero_fmod[] = { 0.0, -0.0, }; VAL [one_fmod=1, Zero_fmod={4:0}] [L171] double x = __VERIFIER_nondet_double(); [L172] double y = 0.0; [L173] CALL fmod_double(x, y) [L26] __int32_t n, hx, hy, hz, ix, iy, sx, i; [L27] __uint32_t lx, ly, lz; VAL [\old(x)=4294967315, \old(y)=0, one_fmod=1, x=4294967315, y=0, Zero_fmod={4:0}] [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (hx) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lx) = ew_u.parts.lsw [L36] ieee_double_shape_type ew_u; [L37] ew_u.value = (y) [L38] EXPR ew_u.parts.msw [L38] (hy) = ew_u.parts.msw [L39] EXPR ew_u.parts.lsw [L39] (ly) = ew_u.parts.lsw [L41] sx = hx & 0x80000000 VAL [\old(x)=4294967315, \old(y)=0, hx=0, hy=7, lx=4294967295, ly=0, one_fmod=1, sx=0, x=4294967315, y=0, Zero_fmod={4:0}] [L42] hx ^= sx [L43] hy &= 0x7fffffff VAL [\old(x)=4294967315, \old(y)=0, hx=0, hy=-1048577, lx=4294967295, ly=0, one_fmod=1, sx=0, x=4294967315, y=0, Zero_fmod={4:0}] [L45-L46] COND FALSE !((hy | ly) == 0 || (hx >= 0x7ff00000) || ((hy | ((ly | -ly) >> 31)) > 0x7ff00000)) VAL [\old(x)=4294967315, \old(y)=0, hx=0, hy=-1048577, lx=4294967295, ly=0, one_fmod=1, sx=0, x=4294967315, y=0, Zero_fmod={4:0}] [L48] COND FALSE !(hx <= hy) VAL [\old(x)=4294967315, \old(y)=0, hx=0, hy=-1048577, lx=4294967295, ly=0, one_fmod=1, sx=0, x=4294967315, y=0, Zero_fmod={4:0}] [L55] COND TRUE hx < 0x00100000 VAL [\old(x)=4294967315, \old(y)=0, hx=0, hy=-1048577, lx=4294967295, ly=0, one_fmod=1, sx=0, x=4294967315, y=0, Zero_fmod={4:0}] [L56] COND TRUE hx == 0 [L57] ix = -1043 [L57] i = lx VAL [\old(x)=4294967315, \old(y)=0, hx=0, hy=-1048577, i=-1, ix=-1043, lx=4294967295, ly=0, one_fmod=1, sx=0, x=4294967315, y=0, Zero_fmod={4:0}] [L57] COND FALSE !(i > 0) VAL [\old(x)=4294967315, \old(y)=0, hx=0, hy=-1048577, i=-1, ix=-1043, lx=4294967295, ly=0, one_fmod=1, sx=0, x=4294967315, y=0, Zero_fmod={4:0}] [L66] COND TRUE hy < 0x00100000 VAL [\old(x)=4294967315, \old(y)=0, hx=0, hy=-1048577, i=-1, ix=-1043, lx=4294967295, ly=0, one_fmod=1, sx=0, x=4294967315, y=0, Zero_fmod={4:0}] [L67] COND FALSE !(hy == 0) [L71] iy = -1022 VAL [\old(x)=4294967315, \old(y)=0, hx=0, hy=-1048577, i=-1, ix=-1043, iy=-1022, lx=4294967295, ly=0, one_fmod=1, sx=0, x=4294967315, y=0, Zero_fmod={4:0}] [L71] hy << 11 VAL [\old(x)=4294967315, \old(y)=0, hx=0, hy=-1048577, i=-1, ix=-1043, iy=-1022, lx=4294967295, ly=0, one_fmod=1, sx=0, x=4294967315, y=0, Zero_fmod={4:0}] - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 102]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 102]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 103]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 103]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 130]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 130]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 143]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 143]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 148]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 151]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 151]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 231 locations, 74 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2182 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2182 mSDsluCounter, 4182 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1897 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 589 IncrementalHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 2285 mSDtfsCounter, 589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=513occurred in iteration=8, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 1075 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 185 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-16 12:01:53,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...