/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_1122a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 12:01:47,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 12:01:47,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 12:01:47,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 12:01:47,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 12:01:47,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 12:01:47,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 12:01:47,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 12:01:47,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 12:01:47,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 12:01:47,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 12:01:47,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 12:01:47,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 12:01:47,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 12:01:47,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 12:01:47,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 12:01:47,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 12:01:47,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 12:01:47,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 12:01:47,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 12:01:47,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 12:01:47,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 12:01:47,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 12:01:47,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 12:01:47,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 12:01:47,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 12:01:47,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 12:01:47,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 12:01:47,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 12:01:47,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 12:01:47,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 12:01:47,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 12:01:47,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 12:01:47,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 12:01:47,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 12:01:47,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 12:01:47,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 12:01:47,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 12:01:47,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 12:01:47,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 12:01:47,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 12:01:47,382 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:47,438 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 12:01:47,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 12:01:47,440 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 12:01:47,440 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 12:01:47,442 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 12:01:47,442 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 12:01:47,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 12:01:47,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 12:01:47,446 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 12:01:47,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 12:01:47,448 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 12:01:47,449 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 12:01:47,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 12:01:47,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 12:01:47,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 12:01:47,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 12:01:47,450 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 12:01:47,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 12:01:47,451 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 12:01:47,451 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 12:01:47,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 12:01:47,452 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 12:01:47,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 12:01:47,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 12:01:47,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 12:01:47,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 12:01:47,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:01:47,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 12:01:47,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 12:01:47,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 12:01:47,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 12:01:47,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 12:01:47,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 12:01:47,456 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,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 12:01:47,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 12:01:47,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 12:01:47,909 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 12:01:47,910 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 12:01:47,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1122a.c [2022-10-16 12:01:48,000 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad91e5d8/5a5d0cf7dc2b4f0a8304e85bb1e74ccd/FLAGed313e5ce [2022-10-16 12:01:48,677 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 12:01:48,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1122a.c [2022-10-16 12:01:48,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad91e5d8/5a5d0cf7dc2b4f0a8304e85bb1e74ccd/FLAGed313e5ce [2022-10-16 12:01:48,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad91e5d8/5a5d0cf7dc2b4f0a8304e85bb1e74ccd [2022-10-16 12:01:48,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 12:01:48,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 12:01:48,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 12:01:48,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 12:01:48,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 12:01:48,972 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,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8320d0d 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,975 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,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 12:01:49,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 12:01:49,344 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_1122a.c[3905,3918] [2022-10-16 12:01:49,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:01:49,354 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 12:01:49,415 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_1122a.c[3905,3918] [2022-10-16 12:01:49,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:01:49,433 INFO L208 MainTranslator]: Completed translation [2022-10-16 12:01:49,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:49 WrapperNode [2022-10-16 12:01:49,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 12:01:49,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 12:01:49,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 12:01:49,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 12:01:49,445 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:49" (1/1) ... [2022-10-16 12:01:49,460 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:49" (1/1) ... [2022-10-16 12:01:49,549 INFO L138 Inliner]: procedures = 18, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 380 [2022-10-16 12:01:49,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 12:01:49,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 12:01:49,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 12:01:49,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 12:01:49,562 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:49" (1/1) ... [2022-10-16 12:01:49,562 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:49" (1/1) ... [2022-10-16 12:01:49,582 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:49" (1/1) ... [2022-10-16 12:01:49,582 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:49" (1/1) ... [2022-10-16 12:01:49,611 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:49" (1/1) ... [2022-10-16 12:01:49,620 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:49" (1/1) ... [2022-10-16 12:01:49,628 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:49" (1/1) ... [2022-10-16 12:01:49,633 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:49" (1/1) ... [2022-10-16 12:01:49,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 12:01:49,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 12:01:49,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 12:01:49,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 12:01:49,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:49" (1/1) ... [2022-10-16 12:01:49,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:01:49,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:01:49,685 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,709 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,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 12:01:49,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 12:01:49,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 12:01:49,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 12:01:49,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 12:01:49,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 12:01:49,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 12:01:49,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 12:01:49,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 12:01:49,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-16 12:01:49,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 12:01:49,852 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 12:01:49,855 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 12:01:50,883 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 12:01:50,903 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 12:01:50,903 INFO L300 CfgBuilder]: Removed 14 assume(true) statements. [2022-10-16 12:01:50,909 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,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 12:01:50,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 12:01:50,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 12:01:50,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 12:01:50,917 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,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6e11eb 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,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:01:49" (2/3) ... [2022-10-16 12:01:50,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6e11eb 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,919 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,921 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1122a.c [2022-10-16 12:01:50,943 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 12:01:50,944 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 74 error locations. [2022-10-16 12:01:51,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 12:01:51,031 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;@745a424e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 12:01:51,032 INFO L358 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2022-10-16 12:01:51,038 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:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 12:01:51,047 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:51,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:51,048 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:51,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash 736695697, now seen corresponding path program 1 times [2022-10-16 12:01:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:51,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267153802] [2022-10-16 12:01:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:51,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:51,276 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,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:51,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267153802] [2022-10-16 12:01:51,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267153802] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:51,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:51,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:51,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212467188] [2022-10-16 12:01:51,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:51,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 12:01:51,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:51,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 12:01:51,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:01:51,324 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:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:51,373 INFO L93 Difference]: Finished difference Result 460 states and 598 transitions. [2022-10-16 12:01:51,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 12:01:51,379 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:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:51,394 INFO L225 Difference]: With dead ends: 460 [2022-10-16 12:01:51,394 INFO L226 Difference]: Without dead ends: 209 [2022-10-16 12:01:51,400 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:51,405 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:51,407 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:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-10-16 12:01:51,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-10-16 12:01:51,466 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:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 239 transitions. [2022-10-16 12:01:51,471 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 239 transitions. Word has length 10 [2022-10-16 12:01:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:51,471 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 239 transitions. [2022-10-16 12:01:51,472 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:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 239 transitions. [2022-10-16 12:01:51,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 12:01:51,473 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:51,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:51,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 12:01:51,474 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:51,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash 201256782, now seen corresponding path program 1 times [2022-10-16 12:01:51,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:51,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541671591] [2022-10-16 12:01:51,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:51,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:51,885 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,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:51,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541671591] [2022-10-16 12:01:51,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541671591] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:51,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:51,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:01:51,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453698040] [2022-10-16 12:01:51,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:51,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:01:51,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:01:51,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:01:51,890 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:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:52,164 INFO L93 Difference]: Finished difference Result 658 states and 772 transitions. [2022-10-16 12:01:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:01:52,164 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:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:52,169 INFO L225 Difference]: With dead ends: 658 [2022-10-16 12:01:52,169 INFO L226 Difference]: Without dead ends: 464 [2022-10-16 12:01:52,171 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:52,173 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.2s IncrementalHoareTripleChecker+Time [2022-10-16 12:01:52,174 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.2s Time] [2022-10-16 12:01:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-10-16 12:01:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 290. [2022-10-16 12:01:52,201 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:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 380 transitions. [2022-10-16 12:01:52,204 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 380 transitions. Word has length 12 [2022-10-16 12:01:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:52,205 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 380 transitions. [2022-10-16 12:01:52,205 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:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 380 transitions. [2022-10-16 12:01:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 12:01:52,208 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:52,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:52,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 12:01:52,209 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:52,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:52,213 INFO L85 PathProgramCache]: Analyzing trace with hash 132859889, now seen corresponding path program 1 times [2022-10-16 12:01:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:52,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093903730] [2022-10-16 12:01:52,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:52,348 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,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:52,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093903730] [2022-10-16 12:01:52,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093903730] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:52,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:52,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:52,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971964055] [2022-10-16 12:01:52,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:52,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 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 3 interpolants. [2022-10-16 12:01:52,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:52,352 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,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:52,405 INFO L93 Difference]: Finished difference Result 429 states and 516 transitions. [2022-10-16 12:01:52,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:52,406 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,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:52,408 INFO L225 Difference]: With dead ends: 429 [2022-10-16 12:01:52,409 INFO L226 Difference]: Without dead ends: 427 [2022-10-16 12:01:52,409 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,411 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,412 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,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-10-16 12:01:52,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 289. [2022-10-16 12:01:52,428 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,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 378 transitions. [2022-10-16 12:01:52,430 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 378 transitions. Word has length 14 [2022-10-16 12:01:52,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:52,430 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 378 transitions. [2022-10-16 12:01:52,430 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,431 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 378 transitions. [2022-10-16 12:01:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:01:52,431 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:52,432 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,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 12:01:52,432 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,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash -176309823, now seen corresponding path program 1 times [2022-10-16 12:01:52,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:52,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221525517] [2022-10-16 12:01:52,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:52,622 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,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:52,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221525517] [2022-10-16 12:01:52,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221525517] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:52,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:52,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 12:01:52,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731982088] [2022-10-16 12:01:52,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:52,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 12:01:52,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:52,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 12:01:52,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:01:52,626 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,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:52,927 INFO L93 Difference]: Finished difference Result 893 states and 1057 transitions. [2022-10-16 12:01:52,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:01:52,928 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,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:52,932 INFO L225 Difference]: With dead ends: 893 [2022-10-16 12:01:52,932 INFO L226 Difference]: Without dead ends: 691 [2022-10-16 12:01:52,937 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,948 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,948 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,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-10-16 12:01:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 347. [2022-10-16 12:01:52,979 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,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 476 transitions. [2022-10-16 12:01:52,980 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 476 transitions. Word has length 15 [2022-10-16 12:01:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:52,981 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 476 transitions. [2022-10-16 12:01:52,981 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,981 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 476 transitions. [2022-10-16 12:01:52,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:01:52,983 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:52,984 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,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 12:01:52,984 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,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:52,986 INFO L85 PathProgramCache]: Analyzing trace with hash -176310621, now seen corresponding path program 1 times [2022-10-16 12:01:52,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:52,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049697417] [2022-10-16 12:01:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:52,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:53,098 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,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:53,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049697417] [2022-10-16 12:01:53,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049697417] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:53,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:53,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781891609] [2022-10-16 12:01:53,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:53,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:53,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:53,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:53,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:53,106 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:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:53,166 INFO L93 Difference]: Finished difference Result 651 states and 904 transitions. [2022-10-16 12:01:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:53,167 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:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:53,183 INFO L225 Difference]: With dead ends: 651 [2022-10-16 12:01:53,183 INFO L226 Difference]: Without dead ends: 648 [2022-10-16 12:01:53,184 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,188 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:53,191 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:53,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-10-16 12:01:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 398. [2022-10-16 12:01:53,211 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:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 560 transitions. [2022-10-16 12:01:53,213 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 560 transitions. Word has length 15 [2022-10-16 12:01:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:53,214 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 560 transitions. [2022-10-16 12:01:53,215 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:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 560 transitions. [2022-10-16 12:01:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:01:53,227 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:53,227 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:53,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 12:01:53,229 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:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:53,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1705182292, now seen corresponding path program 1 times [2022-10-16 12:01:53,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:53,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729514468] [2022-10-16 12:01:53,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:53,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:53,357 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,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:53,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729514468] [2022-10-16 12:01:53,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729514468] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:53,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:53,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:53,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239427029] [2022-10-16 12:01:53,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:53,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:53,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:53,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:53,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:53,361 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:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:53,468 INFO L93 Difference]: Finished difference Result 508 states and 683 transitions. [2022-10-16 12:01:53,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:53,469 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:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:53,473 INFO L225 Difference]: With dead ends: 508 [2022-10-16 12:01:53,474 INFO L226 Difference]: Without dead ends: 506 [2022-10-16 12:01:53,474 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,476 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:53,477 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:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-10-16 12:01:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 435. [2022-10-16 12:01:53,497 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:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 627 transitions. [2022-10-16 12:01:53,500 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 627 transitions. Word has length 15 [2022-10-16 12:01:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:53,500 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 627 transitions. [2022-10-16 12:01:53,500 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:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 627 transitions. [2022-10-16 12:01:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 12:01:53,503 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:53,503 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,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 12:01:53,504 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:53,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:53,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1321043350, now seen corresponding path program 1 times [2022-10-16 12:01:53,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:53,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435863289] [2022-10-16 12:01:53,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:53,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:53,592 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,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:53,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435863289] [2022-10-16 12:01:53,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435863289] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:53,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:53,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:53,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539283972] [2022-10-16 12:01:53,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:53,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:53,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:53,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:53,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:53,595 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,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:53,711 INFO L93 Difference]: Finished difference Result 606 states and 824 transitions. [2022-10-16 12:01:53,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:53,711 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,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:53,716 INFO L225 Difference]: With dead ends: 606 [2022-10-16 12:01:53,716 INFO L226 Difference]: Without dead ends: 556 [2022-10-16 12:01:53,717 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,718 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,719 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,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-10-16 12:01:53,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 508. [2022-10-16 12:01:53,740 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,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 762 transitions. [2022-10-16 12:01:53,743 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 762 transitions. Word has length 16 [2022-10-16 12:01:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:53,743 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 762 transitions. [2022-10-16 12:01:53,743 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,744 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 762 transitions. [2022-10-16 12:01:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 12:01:53,748 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:53,748 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,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 12:01:53,749 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,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:53,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1321087395, now seen corresponding path program 1 times [2022-10-16 12:01:53,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:53,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609694949] [2022-10-16 12:01:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:53,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:01:53,805 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,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:01:53,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609694949] [2022-10-16 12:01:53,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609694949] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:01:53,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:01:53,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:01:53,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869980618] [2022-10-16 12:01:53,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:01:53,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:01:53,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:01:53,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:01:53,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:01:53,809 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,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:01:53,912 INFO L93 Difference]: Finished difference Result 603 states and 825 transitions. [2022-10-16 12:01:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:01:53,913 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,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:01:53,917 INFO L225 Difference]: With dead ends: 603 [2022-10-16 12:01:53,917 INFO L226 Difference]: Without dead ends: 563 [2022-10-16 12:01:53,917 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,918 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,919 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,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-10-16 12:01:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 513. [2022-10-16 12:01:53,937 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,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 772 transitions. [2022-10-16 12:01:53,946 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 772 transitions. Word has length 16 [2022-10-16 12:01:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:01:53,947 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 772 transitions. [2022-10-16 12:01:53,947 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,947 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 772 transitions. [2022-10-16 12:01:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 12:01:53,948 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:01:53,948 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,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 12:01:53,949 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,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:01:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1931374281, now seen corresponding path program 1 times [2022-10-16 12:01:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:01:53,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347847957] [2022-10-16 12:01:53,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:01:53,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:01:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:01:54,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 12:01:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:01:54,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 12:01:54,189 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 12:01:54,192 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 74 remaining) [2022-10-16 12:01:54,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 74 remaining) [2022-10-16 12:01:54,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 74 remaining) [2022-10-16 12:01:54,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 74 remaining) [2022-10-16 12:01:54,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 74 remaining) [2022-10-16 12:01:54,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 74 remaining) [2022-10-16 12:01:54,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 74 remaining) [2022-10-16 12:01:54,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 74 remaining) [2022-10-16 12:01:54,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 74 remaining) [2022-10-16 12:01:54,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 74 remaining) [2022-10-16 12:01:54,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 74 remaining) [2022-10-16 12:01:54,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 74 remaining) [2022-10-16 12:01:54,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 74 remaining) [2022-10-16 12:01:54,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 74 remaining) [2022-10-16 12:01:54,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 74 remaining) [2022-10-16 12:01:54,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 74 remaining) [2022-10-16 12:01:54,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 74 remaining) [2022-10-16 12:01:54,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 74 remaining) [2022-10-16 12:01:54,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 74 remaining) [2022-10-16 12:01:54,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 74 remaining) [2022-10-16 12:01:54,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 74 remaining) [2022-10-16 12:01:54,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 74 remaining) [2022-10-16 12:01:54,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 74 remaining) [2022-10-16 12:01:54,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 74 remaining) [2022-10-16 12:01:54,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 74 remaining) [2022-10-16 12:01:54,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 74 remaining) [2022-10-16 12:01:54,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 74 remaining) [2022-10-16 12:01:54,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 74 remaining) [2022-10-16 12:01:54,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 74 remaining) [2022-10-16 12:01:54,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 74 remaining) [2022-10-16 12:01:54,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 74 remaining) [2022-10-16 12:01:54,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 74 remaining) [2022-10-16 12:01:54,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 74 remaining) [2022-10-16 12:01:54,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 74 remaining) [2022-10-16 12:01:54,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 74 remaining) [2022-10-16 12:01:54,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 74 remaining) [2022-10-16 12:01:54,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 74 remaining) [2022-10-16 12:01:54,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 74 remaining) [2022-10-16 12:01:54,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 74 remaining) [2022-10-16 12:01:54,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 74 remaining) [2022-10-16 12:01:54,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 74 remaining) [2022-10-16 12:01:54,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 74 remaining) [2022-10-16 12:01:54,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 74 remaining) [2022-10-16 12:01:54,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 74 remaining) [2022-10-16 12:01:54,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 74 remaining) [2022-10-16 12:01:54,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 74 remaining) [2022-10-16 12:01:54,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 74 remaining) [2022-10-16 12:01:54,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 74 remaining) [2022-10-16 12:01:54,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 74 remaining) [2022-10-16 12:01:54,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 74 remaining) [2022-10-16 12:01:54,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 74 remaining) [2022-10-16 12:01:54,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 74 remaining) [2022-10-16 12:01:54,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 74 remaining) [2022-10-16 12:01:54,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 74 remaining) [2022-10-16 12:01:54,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 74 remaining) [2022-10-16 12:01:54,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 74 remaining) [2022-10-16 12:01:54,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 74 remaining) [2022-10-16 12:01:54,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 74 remaining) [2022-10-16 12:01:54,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 74 remaining) [2022-10-16 12:01:54,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 74 remaining) [2022-10-16 12:01:54,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 74 remaining) [2022-10-16 12:01:54,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 74 remaining) [2022-10-16 12:01:54,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 74 remaining) [2022-10-16 12:01:54,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 74 remaining) [2022-10-16 12:01:54,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 74 remaining) [2022-10-16 12:01:54,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 74 remaining) [2022-10-16 12:01:54,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 74 remaining) [2022-10-16 12:01:54,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 74 remaining) [2022-10-16 12:01:54,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 74 remaining) [2022-10-16 12:01:54,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 74 remaining) [2022-10-16 12:01:54,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 74 remaining) [2022-10-16 12:01:54,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 74 remaining) [2022-10-16 12:01:54,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 74 remaining) [2022-10-16 12:01:54,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 74 remaining) [2022-10-16 12:01:54,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 12:01:54,222 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:01:54,227 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 12:01:54,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:01:54 BoogieIcfgContainer [2022-10-16 12:01:54,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 12:01:54,283 INFO L158 Benchmark]: Toolchain (without parser) took 5324.93ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 124.6MB in the beginning and 159.1MB in the end (delta: -34.5MB). Peak memory consumption was 101.0MB. Max. memory is 8.0GB. [2022-10-16 12:01:54,283 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 125.8MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 12:01:54,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.43ms. Allocated memory is still 151.0MB. Free memory was 124.4MB in the beginning and 110.3MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-16 12:01:54,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.56ms. Allocated memory is still 151.0MB. Free memory was 110.3MB in the beginning and 105.4MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-10-16 12:01:54,284 INFO L158 Benchmark]: Boogie Preprocessor took 92.66ms. Allocated memory is still 151.0MB. Free memory was 105.4MB in the beginning and 101.8MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 12:01:54,285 INFO L158 Benchmark]: RCFGBuilder took 1264.64ms. Allocated memory is still 151.0MB. Free memory was 101.8MB in the beginning and 94.4MB in the end (delta: 7.4MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. [2022-10-16 12:01:54,285 INFO L158 Benchmark]: TraceAbstraction took 3369.56ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 94.0MB in the beginning and 159.1MB in the end (delta: -65.0MB). Peak memory consumption was 69.3MB. Max. memory is 8.0GB. [2022-10-16 12:01:54,287 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.22ms. Allocated memory is still 125.8MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 468.43ms. Allocated memory is still 151.0MB. Free memory was 124.4MB in the beginning and 110.3MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 113.56ms. Allocated memory is still 151.0MB. Free memory was 110.3MB in the beginning and 105.4MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 92.66ms. Allocated memory is still 151.0MB. Free memory was 105.4MB in the beginning and 101.8MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1264.64ms. Allocated memory is still 151.0MB. Free memory was 101.8MB in the beginning and 94.4MB in the end (delta: 7.4MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3369.56ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 94.0MB in the beginning and 159.1MB in the end (delta: -65.0MB). Peak memory consumption was 69.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 someBinaryArithmeticDOUBLEoperation at line 172, 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}] [L172] double x = 1.0 / 0.0; [L173] double y = __VERIFIER_nondet_double(); [L174] 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)=8589934603, \old(y)=8589934602, one_fmod=1, x=8589934603, y=8589934602, 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)=8589934603, \old(y)=8589934602, hx=0, hy=-2, lx=4294967295, ly=0, one_fmod=1, sx=0, x=8589934603, y=8589934602, Zero_fmod={4:0}] [L42] hx ^= sx [L43] hy &= 0x7fffffff VAL [\old(x)=8589934603, \old(y)=8589934602, hx=0, hy=-4294967295, lx=4294967295, ly=0, one_fmod=1, sx=0, x=8589934603, y=8589934602, Zero_fmod={4:0}] [L45-L46] COND FALSE !((hy | ly) == 0 || (hx >= 0x7ff00000) || ((hy | ((ly | -ly) >> 31)) > 0x7ff00000)) VAL [\old(x)=8589934603, \old(y)=8589934602, hx=0, hy=-4294967295, lx=4294967295, ly=0, one_fmod=1, sx=0, x=8589934603, y=8589934602, Zero_fmod={4:0}] [L48] COND FALSE !(hx <= hy) VAL [\old(x)=8589934603, \old(y)=8589934602, hx=0, hy=-4294967295, lx=4294967295, ly=0, one_fmod=1, sx=0, x=8589934603, y=8589934602, Zero_fmod={4:0}] [L55] COND TRUE hx < 0x00100000 VAL [\old(x)=8589934603, \old(y)=8589934602, hx=0, hy=-4294967295, lx=4294967295, ly=0, one_fmod=1, sx=0, x=8589934603, y=8589934602, Zero_fmod={4:0}] [L56] COND TRUE hx == 0 [L57] ix = -1043 [L57] i = lx VAL [\old(x)=8589934603, \old(y)=8589934602, hx=0, hy=-4294967295, i=-1, ix=-1043, lx=4294967295, ly=0, one_fmod=1, sx=0, x=8589934603, y=8589934602, Zero_fmod={4:0}] [L57] COND FALSE !(i > 0) VAL [\old(x)=8589934603, \old(y)=8589934602, hx=0, hy=-4294967295, i=-1, ix=-1043, lx=4294967295, ly=0, one_fmod=1, sx=0, x=8589934603, y=8589934602, Zero_fmod={4:0}] [L66] COND TRUE hy < 0x00100000 VAL [\old(x)=8589934603, \old(y)=8589934602, hx=0, hy=-4294967295, i=-1, ix=-1043, lx=4294967295, ly=0, one_fmod=1, sx=0, x=8589934603, y=8589934602, Zero_fmod={4:0}] [L67] COND FALSE !(hy == 0) [L71] iy = -1022 VAL [\old(x)=8589934603, \old(y)=8589934602, hx=0, hy=-4294967295, i=-1, ix=-1043, iy=-1022, lx=4294967295, ly=0, one_fmod=1, sx=0, x=8589934603, y=8589934602, Zero_fmod={4:0}] [L71] hy << 11 VAL [\old(x)=8589934603, \old(y)=8589934602, hx=0, hy=-4294967295, i=-1, ix=-1043, iy=-1022, lx=4294967295, ly=0, one_fmod=1, sx=0, x=8589934603, y=8589934602, 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.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2182 SdHoareTripleChecker+Valid, 0.8s 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s 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:54,317 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...