/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/float_req_bl_0260.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 20:49:12,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 20:49:12,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 20:49:12,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 20:49:12,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 20:49:12,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 20:49:12,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 20:49:12,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 20:49:12,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 20:49:12,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 20:49:12,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 20:49:12,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 20:49:12,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 20:49:12,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 20:49:12,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 20:49:12,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 20:49:12,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 20:49:12,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 20:49:12,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 20:49:12,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 20:49:12,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 20:49:12,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 20:49:12,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 20:49:12,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 20:49:12,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 20:49:12,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 20:49:12,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 20:49:12,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 20:49:12,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 20:49:12,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 20:49:12,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 20:49:12,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 20:49:12,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 20:49:12,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 20:49:12,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 20:49:12,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 20:49:12,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 20:49:12,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 20:49:12,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 20:49:12,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 20:49:12,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 20:49:12,451 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-15 20:49:12,487 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 20:49:12,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 20:49:12,488 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 20:49:12,488 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 20:49:12,489 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 20:49:12,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 20:49:12,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 20:49:12,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 20:49:12,491 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 20:49:12,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 20:49:12,492 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 20:49:12,492 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 20:49:12,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 20:49:12,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 20:49:12,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 20:49:12,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 20:49:12,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 20:49:12,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 20:49:12,494 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 20:49:12,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 20:49:12,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 20:49:12,495 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 20:49:12,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 20:49:12,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 20:49:12,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 20:49:12,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 20:49:12,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 20:49:12,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 20:49:12,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 20:49:12,498 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 20:49:12,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 20:49:12,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 20:49:12,499 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 20:49:12,499 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-15 20:49:12,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 20:49:12,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 20:49:13,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 20:49:13,003 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 20:49:13,003 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 20:49:13,005 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0260.c [2022-10-15 20:49:13,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9fd5503/7bfd4fecfbb14aefb6e5fd70402efbc2/FLAG34eb04a21 [2022-10-15 20:49:13,876 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 20:49:13,877 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0260.c [2022-10-15 20:49:13,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9fd5503/7bfd4fecfbb14aefb6e5fd70402efbc2/FLAG34eb04a21 [2022-10-15 20:49:14,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9fd5503/7bfd4fecfbb14aefb6e5fd70402efbc2 [2022-10-15 20:49:14,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 20:49:14,252 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 20:49:14,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 20:49:14,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 20:49:14,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 20:49:14,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:49:14" (1/1) ... [2022-10-15 20:49:14,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bae1042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14, skipping insertion in model container [2022-10-15 20:49:14,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:49:14" (1/1) ... [2022-10-15 20:49:14,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 20:49:14,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 20:49:14,770 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/float_req_bl_0260.c[4552,4565] [2022-10-15 20:49:14,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 20:49:14,794 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 20:49:14,852 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/float_req_bl_0260.c[4552,4565] [2022-10-15 20:49:14,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 20:49:14,877 INFO L208 MainTranslator]: Completed translation [2022-10-15 20:49:14,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14 WrapperNode [2022-10-15 20:49:14,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 20:49:14,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 20:49:14,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 20:49:14,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 20:49:14,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14" (1/1) ... [2022-10-15 20:49:14,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14" (1/1) ... [2022-10-15 20:49:14,960 INFO L138 Inliner]: procedures = 19, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 301 [2022-10-15 20:49:14,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 20:49:14,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 20:49:14,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 20:49:14,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 20:49:14,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14" (1/1) ... [2022-10-15 20:49:14,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14" (1/1) ... [2022-10-15 20:49:14,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14" (1/1) ... [2022-10-15 20:49:14,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14" (1/1) ... [2022-10-15 20:49:14,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14" (1/1) ... [2022-10-15 20:49:15,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14" (1/1) ... [2022-10-15 20:49:15,011 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14" (1/1) ... [2022-10-15 20:49:15,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14" (1/1) ... [2022-10-15 20:49:15,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 20:49:15,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 20:49:15,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 20:49:15,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 20:49:15,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14" (1/1) ... [2022-10-15 20:49:15,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 20:49:15,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:49:15,071 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-15 20:49:15,087 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-15 20:49:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 20:49:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 20:49:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 20:49:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 20:49:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 20:49:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 20:49:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 20:49:15,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 20:49:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 20:49:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 20:49:15,285 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 20:49:15,288 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 20:49:16,330 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 20:49:16,350 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 20:49:16,350 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-10-15 20:49:16,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:49:16 BoogieIcfgContainer [2022-10-15 20:49:16,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 20:49:16,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 20:49:16,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 20:49:16,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 20:49:16,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 08:49:14" (1/3) ... [2022-10-15 20:49:16,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6f0698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:49:16, skipping insertion in model container [2022-10-15 20:49:16,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:49:14" (2/3) ... [2022-10-15 20:49:16,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6f0698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:49:16, skipping insertion in model container [2022-10-15 20:49:16,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:49:16" (3/3) ... [2022-10-15 20:49:16,371 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0260.c [2022-10-15 20:49:16,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 20:49:16,399 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-10-15 20:49:16,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 20:49:16,546 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;@46996b91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 20:49:16,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-10-15 20:49:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 85 states have (on average 1.8588235294117648) internal successors, (158), 111 states have internal predecessors, (158), 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-15 20:49:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 20:49:16,571 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:49:16,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:49:16,574 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-15 20:49:16,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:49:16,586 INFO L85 PathProgramCache]: Analyzing trace with hash 100031431, now seen corresponding path program 1 times [2022-10-15 20:49:16,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:49:16,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902946030] [2022-10-15 20:49:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:49:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:49:16,872 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-15 20:49:16,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:49:16,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902946030] [2022-10-15 20:49:16,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902946030] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:49:16,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:49:16,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 20:49:16,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731361958] [2022-10-15 20:49:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:49:16,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-15 20:49:16,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:49:16,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-15 20:49:16,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 20:49:16,929 INFO L87 Difference]: Start difference. First operand has 112 states, 85 states have (on average 1.8588235294117648) internal successors, (158), 111 states have internal predecessors, (158), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-15 20:49:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:49:16,988 INFO L93 Difference]: Finished difference Result 222 states and 314 transitions. [2022-10-15 20:49:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-15 20:49:16,992 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2022-10-15 20:49:16,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:49:17,006 INFO L225 Difference]: With dead ends: 222 [2022-10-15 20:49:17,007 INFO L226 Difference]: Without dead ends: 95 [2022-10-15 20:49:17,011 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-15 20:49:17,017 INFO L413 NwaCegarLoop]: 134 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, 134 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-15 20:49:17,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:49:17,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-10-15 20:49:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-10-15 20:49:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.565217391304348) internal successors, (108), 94 states have internal predecessors, (108), 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-15 20:49:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-10-15 20:49:17,075 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 19 [2022-10-15 20:49:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:49:17,076 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-10-15 20:49:17,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-15 20:49:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-10-15 20:49:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 20:49:17,077 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:49:17,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:49:17,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 20:49:17,079 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-15 20:49:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:49:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash 686801981, now seen corresponding path program 1 times [2022-10-15 20:49:17,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:49:17,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003086005] [2022-10-15 20:49:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:17,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:49:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:49:17,347 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-15 20:49:17,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:49:17,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003086005] [2022-10-15 20:49:17,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003086005] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:49:17,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:49:17,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:49:17,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480460176] [2022-10-15 20:49:17,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:49:17,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 20:49:17,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:49:17,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 20:49:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:49:17,355 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-15 20:49:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:49:17,412 INFO L93 Difference]: Finished difference Result 264 states and 298 transitions. [2022-10-15 20:49:17,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 20:49:17,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-10-15 20:49:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:49:17,416 INFO L225 Difference]: With dead ends: 264 [2022-10-15 20:49:17,417 INFO L226 Difference]: Without dead ends: 182 [2022-10-15 20:49:17,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 20:49:17,421 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 95 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:49:17,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 203 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:49:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-10-15 20:49:17,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 98. [2022-10-15 20:49:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 97 states have internal predecessors, (111), 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-15 20:49:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-10-15 20:49:17,439 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 23 [2022-10-15 20:49:17,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:49:17,440 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-10-15 20:49:17,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-15 20:49:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-10-15 20:49:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 20:49:17,442 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:49:17,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:49:17,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 20:49:17,443 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-15 20:49:17,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:49:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash -419471579, now seen corresponding path program 1 times [2022-10-15 20:49:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:49:17,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947943090] [2022-10-15 20:49:17,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:17,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:49:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:49:17,985 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-15 20:49:17,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:49:17,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947943090] [2022-10-15 20:49:17,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947943090] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:49:17,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:49:17,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:49:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934734553] [2022-10-15 20:49:17,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:49:17,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:49:17,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:49:17,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:49:17,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:49:17,995 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-15 20:49:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:49:18,367 INFO L93 Difference]: Finished difference Result 234 states and 279 transitions. [2022-10-15 20:49:18,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 20:49:18,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2022-10-15 20:49:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:49:18,371 INFO L225 Difference]: With dead ends: 234 [2022-10-15 20:49:18,371 INFO L226 Difference]: Without dead ends: 229 [2022-10-15 20:49:18,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 20:49:18,374 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 157 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 20:49:18,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 274 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 20:49:18,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-10-15 20:49:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 164. [2022-10-15 20:49:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.608695652173913) internal successors, (222), 163 states have internal predecessors, (222), 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-15 20:49:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 222 transitions. [2022-10-15 20:49:18,406 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 222 transitions. Word has length 25 [2022-10-15 20:49:18,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:49:18,407 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 222 transitions. [2022-10-15 20:49:18,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-15 20:49:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 222 transitions. [2022-10-15 20:49:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 20:49:18,411 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:49:18,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:49:18,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 20:49:18,412 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-15 20:49:18,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:49:18,415 INFO L85 PathProgramCache]: Analyzing trace with hash -118716859, now seen corresponding path program 1 times [2022-10-15 20:49:18,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:49:18,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441039522] [2022-10-15 20:49:18,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:18,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:49:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:49:18,582 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-15 20:49:18,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:49:18,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441039522] [2022-10-15 20:49:18,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441039522] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:49:18,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:49:18,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:49:18,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893538806] [2022-10-15 20:49:18,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:49:18,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:49:18,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:49:18,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:49:18,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:49:18,587 INFO L87 Difference]: Start difference. First operand 164 states and 222 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-15 20:49:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:49:18,723 INFO L93 Difference]: Finished difference Result 336 states and 449 transitions. [2022-10-15 20:49:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 20:49:18,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2022-10-15 20:49:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:49:18,726 INFO L225 Difference]: With dead ends: 336 [2022-10-15 20:49:18,726 INFO L226 Difference]: Without dead ends: 229 [2022-10-15 20:49:18,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 20:49:18,730 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 83 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:49:18,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 231 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:49:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-10-15 20:49:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 201. [2022-10-15 20:49:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 175 states have (on average 1.6114285714285714) internal successors, (282), 200 states have internal predecessors, (282), 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-15 20:49:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 282 transitions. [2022-10-15 20:49:18,770 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 282 transitions. Word has length 26 [2022-10-15 20:49:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:49:18,771 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 282 transitions. [2022-10-15 20:49:18,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-15 20:49:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 282 transitions. [2022-10-15 20:49:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-15 20:49:18,773 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:49:18,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:49:18,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 20:49:18,774 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-15 20:49:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:49:18,776 INFO L85 PathProgramCache]: Analyzing trace with hash 613918668, now seen corresponding path program 1 times [2022-10-15 20:49:18,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:49:18,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183343675] [2022-10-15 20:49:18,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:18,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:49:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:49:18,996 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-15 20:49:18,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:49:18,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183343675] [2022-10-15 20:49:18,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183343675] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:49:19,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:49:19,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:49:19,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983947346] [2022-10-15 20:49:19,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:49:19,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:49:19,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:49:19,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:49:19,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:49:19,006 INFO L87 Difference]: Start difference. First operand 201 states and 282 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-15 20:49:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:49:19,086 INFO L93 Difference]: Finished difference Result 321 states and 448 transitions. [2022-10-15 20:49:19,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 20:49:19,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2022-10-15 20:49:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:49:19,091 INFO L225 Difference]: With dead ends: 321 [2022-10-15 20:49:19,091 INFO L226 Difference]: Without dead ends: 317 [2022-10-15 20:49:19,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 20:49:19,102 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 67 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:49:19,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 403 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:49:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-10-15 20:49:19,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 217. [2022-10-15 20:49:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 191 states have (on average 1.5706806282722514) internal successors, (300), 216 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-15 20:49:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 300 transitions. [2022-10-15 20:49:19,147 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 300 transitions. Word has length 27 [2022-10-15 20:49:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:49:19,147 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 300 transitions. [2022-10-15 20:49:19,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-15 20:49:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 300 transitions. [2022-10-15 20:49:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 20:49:19,158 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:49:19,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:49:19,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 20:49:19,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-15 20:49:19,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:49:19,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1426469673, now seen corresponding path program 1 times [2022-10-15 20:49:19,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:49:19,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398558035] [2022-10-15 20:49:19,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:19,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:49:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:49:19,395 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-15 20:49:19,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:49:19,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398558035] [2022-10-15 20:49:19,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398558035] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:49:19,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:49:19,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 20:49:19,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478699175] [2022-10-15 20:49:19,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:49:19,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 20:49:19,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:49:19,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 20:49:19,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 20:49:19,405 INFO L87 Difference]: Start difference. First operand 217 states and 300 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-15 20:49:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:49:19,567 INFO L93 Difference]: Finished difference Result 301 states and 402 transitions. [2022-10-15 20:49:19,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 20:49:19,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2022-10-15 20:49:19,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:49:19,570 INFO L225 Difference]: With dead ends: 301 [2022-10-15 20:49:19,570 INFO L226 Difference]: Without dead ends: 300 [2022-10-15 20:49:19,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 20:49:19,572 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 122 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:49:19,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 191 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:49:19,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-10-15 20:49:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 217. [2022-10-15 20:49:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 216 states have internal predecessors, (299), 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-15 20:49:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 299 transitions. [2022-10-15 20:49:19,586 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 299 transitions. Word has length 28 [2022-10-15 20:49:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:49:19,587 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 299 transitions. [2022-10-15 20:49:19,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-15 20:49:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 299 transitions. [2022-10-15 20:49:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 20:49:19,589 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:49:19,589 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:49:19,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 20:49:19,590 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-15 20:49:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:49:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1040005320, now seen corresponding path program 1 times [2022-10-15 20:49:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:49:19,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165103598] [2022-10-15 20:49:19,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:19,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:49:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:49:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:49:19,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:49:19,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165103598] [2022-10-15 20:49:19,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165103598] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:49:19,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753324201] [2022-10-15 20:49:19,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:19,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:49:19,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:49:19,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 20:49:19,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 20:49:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:49:19,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 20:49:19,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:49:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:49:20,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 20:49:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:49:20,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753324201] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 20:49:20,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 20:49:20,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-15 20:49:20,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854745794] [2022-10-15 20:49:20,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 20:49:20,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 20:49:20,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:49:20,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 20:49:20,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-15 20:49:20,084 INFO L87 Difference]: Start difference. First operand 217 states and 299 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 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-15 20:49:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:49:20,366 INFO L93 Difference]: Finished difference Result 670 states and 935 transitions. [2022-10-15 20:49:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 20:49:20,367 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 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 31 [2022-10-15 20:49:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:49:20,373 INFO L225 Difference]: With dead ends: 670 [2022-10-15 20:49:20,373 INFO L226 Difference]: Without dead ends: 668 [2022-10-15 20:49:20,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-15 20:49:20,376 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 273 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 20:49:20,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1053 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 20:49:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-10-15 20:49:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 252. [2022-10-15 20:49:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 226 states have (on average 1.5309734513274336) internal successors, (346), 251 states have internal predecessors, (346), 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-15 20:49:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 346 transitions. [2022-10-15 20:49:20,399 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 346 transitions. Word has length 31 [2022-10-15 20:49:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:49:20,400 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 346 transitions. [2022-10-15 20:49:20,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 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-15 20:49:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 346 transitions. [2022-10-15 20:49:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 20:49:20,401 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:49:20,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:49:20,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 20:49:20,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:49:20,617 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-15 20:49:20,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:49:20,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1577064027, now seen corresponding path program 1 times [2022-10-15 20:49:20,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:49:20,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517953727] [2022-10-15 20:49:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:20,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:49:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:49:20,829 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-15 20:49:20,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:49:20,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517953727] [2022-10-15 20:49:20,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517953727] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:49:20,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:49:20,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 20:49:20,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584488276] [2022-10-15 20:49:20,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:49:20,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 20:49:20,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:49:20,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 20:49:20,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:49:20,834 INFO L87 Difference]: Start difference. First operand 252 states and 346 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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-15 20:49:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:49:21,035 INFO L93 Difference]: Finished difference Result 290 states and 396 transitions. [2022-10-15 20:49:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 20:49:21,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2022-10-15 20:49:21,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:49:21,042 INFO L225 Difference]: With dead ends: 290 [2022-10-15 20:49:21,042 INFO L226 Difference]: Without dead ends: 289 [2022-10-15 20:49:21,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:49:21,044 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 37 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 20:49:21,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 273 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 20:49:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-10-15 20:49:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2022-10-15 20:49:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 253 states have internal predecessors, (348), 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-15 20:49:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 348 transitions. [2022-10-15 20:49:21,068 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 348 transitions. Word has length 31 [2022-10-15 20:49:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:49:21,069 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 348 transitions. [2022-10-15 20:49:21,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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-15 20:49:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 348 transitions. [2022-10-15 20:49:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 20:49:21,074 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:49:21,075 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:49:21,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 20:49:21,076 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-15 20:49:21,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:49:21,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2119573264, now seen corresponding path program 1 times [2022-10-15 20:49:21,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:49:21,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230655726] [2022-10-15 20:49:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:49:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:49:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:49:21,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:49:21,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230655726] [2022-10-15 20:49:21,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230655726] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 20:49:21,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302763446] [2022-10-15 20:49:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:21,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 20:49:21,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 20:49:21,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 20:49:21,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 20:49:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:49:21,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 20:49:21,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 20:49:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 20:49:21,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 20:49:21,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302763446] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:49:21,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 20:49:21,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-15 20:49:21,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554842699] [2022-10-15 20:49:21,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:49:21,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 20:49:21,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:49:21,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 20:49:21,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 20:49:21,542 INFO L87 Difference]: Start difference. First operand 254 states and 348 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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-15 20:49:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:49:21,610 INFO L93 Difference]: Finished difference Result 425 states and 583 transitions. [2022-10-15 20:49:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 20:49:21,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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 32 [2022-10-15 20:49:21,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:49:21,617 INFO L225 Difference]: With dead ends: 425 [2022-10-15 20:49:21,617 INFO L226 Difference]: Without dead ends: 423 [2022-10-15 20:49:21,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-15 20:49:21,626 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 135 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 20:49:21,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 654 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 20:49:21,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-10-15 20:49:21,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 252. [2022-10-15 20:49:21,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 228 states have (on average 1.4780701754385965) internal successors, (337), 251 states have internal predecessors, (337), 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-15 20:49:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 337 transitions. [2022-10-15 20:49:21,644 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 337 transitions. Word has length 32 [2022-10-15 20:49:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:49:21,644 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 337 transitions. [2022-10-15 20:49:21,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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-15 20:49:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 337 transitions. [2022-10-15 20:49:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 20:49:21,646 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:49:21,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:49:21,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 20:49:21,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-10-15 20:49:21,862 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-15 20:49:21,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:49:21,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1644344386, now seen corresponding path program 1 times [2022-10-15 20:49:21,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:49:21,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416862818] [2022-10-15 20:49:21,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:21,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:49:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:49:22,125 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-15 20:49:22,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:49:22,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416862818] [2022-10-15 20:49:22,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416862818] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:49:22,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:49:22,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 20:49:22,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890132040] [2022-10-15 20:49:22,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:49:22,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 20:49:22,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:49:22,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 20:49:22,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 20:49:22,128 INFO L87 Difference]: Start difference. First operand 252 states and 337 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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-15 20:49:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:49:22,360 INFO L93 Difference]: Finished difference Result 322 states and 447 transitions. [2022-10-15 20:49:22,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 20:49:22,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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 32 [2022-10-15 20:49:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:49:22,364 INFO L225 Difference]: With dead ends: 322 [2022-10-15 20:49:22,364 INFO L226 Difference]: Without dead ends: 317 [2022-10-15 20:49:22,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-15 20:49:22,366 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 73 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 20:49:22,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 304 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 20:49:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-10-15 20:49:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 274. [2022-10-15 20:49:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 250 states have (on average 1.452) internal successors, (363), 273 states have internal predecessors, (363), 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-15 20:49:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 363 transitions. [2022-10-15 20:49:22,384 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 363 transitions. Word has length 32 [2022-10-15 20:49:22,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:49:22,384 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 363 transitions. [2022-10-15 20:49:22,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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-15 20:49:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 363 transitions. [2022-10-15 20:49:22,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 20:49:22,386 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:49:22,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:49:22,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 20:49:22,386 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-15 20:49:22,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:49:22,387 INFO L85 PathProgramCache]: Analyzing trace with hash 564931786, now seen corresponding path program 1 times [2022-10-15 20:49:22,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:49:22,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151381406] [2022-10-15 20:49:22,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:22,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:49:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 20:49:22,627 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-15 20:49:22,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 20:49:22,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151381406] [2022-10-15 20:49:22,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151381406] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 20:49:22,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 20:49:22,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 20:49:22,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601095822] [2022-10-15 20:49:22,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 20:49:22,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 20:49:22,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 20:49:22,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 20:49:22,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-15 20:49:22,631 INFO L87 Difference]: Start difference. First operand 274 states and 363 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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-15 20:49:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 20:49:22,828 INFO L93 Difference]: Finished difference Result 359 states and 467 transitions. [2022-10-15 20:49:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 20:49:22,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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 33 [2022-10-15 20:49:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 20:49:22,831 INFO L225 Difference]: With dead ends: 359 [2022-10-15 20:49:22,831 INFO L226 Difference]: Without dead ends: 358 [2022-10-15 20:49:22,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-10-15 20:49:22,833 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 118 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 20:49:22,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 260 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 20:49:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-10-15 20:49:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 273. [2022-10-15 20:49:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 249 states have (on average 1.4457831325301205) internal successors, (360), 272 states have internal predecessors, (360), 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-15 20:49:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 360 transitions. [2022-10-15 20:49:22,851 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 360 transitions. Word has length 33 [2022-10-15 20:49:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 20:49:22,881 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 360 transitions. [2022-10-15 20:49:22,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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-15 20:49:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 360 transitions. [2022-10-15 20:49:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 20:49:22,883 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 20:49:22,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:49:22,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 20:49:22,883 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-10-15 20:49:22,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 20:49:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1816345057, now seen corresponding path program 1 times [2022-10-15 20:49:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 20:49:22,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213025443] [2022-10-15 20:49:22,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 20:49:22,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 20:49:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 20:49:22,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 20:49:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 20:49:22,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 20:49:22,986 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 20:49:22,988 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 26 remaining) [2022-10-15 20:49:22,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 26 remaining) [2022-10-15 20:49:22,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 26 remaining) [2022-10-15 20:49:22,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 26 remaining) [2022-10-15 20:49:22,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 26 remaining) [2022-10-15 20:49:22,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 26 remaining) [2022-10-15 20:49:22,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 26 remaining) [2022-10-15 20:49:22,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 26 remaining) [2022-10-15 20:49:22,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 26 remaining) [2022-10-15 20:49:22,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 26 remaining) [2022-10-15 20:49:22,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 26 remaining) [2022-10-15 20:49:22,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 26 remaining) [2022-10-15 20:49:22,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 26 remaining) [2022-10-15 20:49:22,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 26 remaining) [2022-10-15 20:49:22,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 26 remaining) [2022-10-15 20:49:22,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 26 remaining) [2022-10-15 20:49:22,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 26 remaining) [2022-10-15 20:49:22,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 26 remaining) [2022-10-15 20:49:22,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 26 remaining) [2022-10-15 20:49:22,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 26 remaining) [2022-10-15 20:49:22,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 26 remaining) [2022-10-15 20:49:22,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 26 remaining) [2022-10-15 20:49:22,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 26 remaining) [2022-10-15 20:49:22,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 26 remaining) [2022-10-15 20:49:22,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 26 remaining) [2022-10-15 20:49:22,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 26 remaining) [2022-10-15 20:49:22,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 20:49:23,004 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 20:49:23,010 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 20:49:23,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 08:49:23 BoogieIcfgContainer [2022-10-15 20:49:23,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 20:49:23,078 INFO L158 Benchmark]: Toolchain (without parser) took 8831.44ms. Allocated memory was 157.3MB in the beginning and 198.2MB in the end (delta: 40.9MB). Free memory was 131.5MB in the beginning and 160.6MB in the end (delta: -29.1MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-10-15 20:49:23,078 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 157.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 20:49:23,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.46ms. Allocated memory is still 157.3MB. Free memory was 131.4MB in the beginning and 118.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 20:49:23,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.85ms. Allocated memory is still 157.3MB. Free memory was 118.4MB in the beginning and 115.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 20:49:23,080 INFO L158 Benchmark]: Boogie Preprocessor took 57.60ms. Allocated memory is still 157.3MB. Free memory was 115.7MB in the beginning and 113.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 20:49:23,080 INFO L158 Benchmark]: RCFGBuilder took 1334.59ms. Allocated memory is still 157.3MB. Free memory was 113.4MB in the beginning and 123.0MB in the end (delta: -9.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 20:49:23,081 INFO L158 Benchmark]: TraceAbstraction took 6717.36ms. Allocated memory was 157.3MB in the beginning and 198.2MB in the end (delta: 40.9MB). Free memory was 121.9MB in the beginning and 160.6MB in the end (delta: -38.7MB). Peak memory consumption was 2.2MB. Max. memory is 8.0GB. [2022-10-15 20:49:23,083 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.29ms. Allocated memory is still 157.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 620.46ms. Allocated memory is still 157.3MB. Free memory was 131.4MB in the beginning and 118.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 81.85ms. Allocated memory is still 157.3MB. Free memory was 118.4MB in the beginning and 115.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.60ms. Allocated memory is still 157.3MB. Free memory was 115.7MB in the beginning and 113.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1334.59ms. Allocated memory is still 157.3MB. Free memory was 113.4MB in the beginning and 123.0MB in the end (delta: -9.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6717.36ms. Allocated memory was 157.3MB in the beginning and 198.2MB in the end (delta: 40.9MB). Free memory was 121.9MB in the beginning and 160.6MB in the end (delta: -38.7MB). Peak memory consumption was 2.2MB. 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: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someUnaryDOUBLEoperation at line 104, overapproximation of bitwiseAnd at line 46, overapproximation of someUnaryFLOAToperation at line 102, overapproximation of someBinaryArithmeticFLOAToperation at line 141. Possible FailurePath: [L17] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; [L100-L108] static const float one_asin = 1.0000000000e+00, huge_asin = 1.000e+30, pio2_hi_asin = 1.57079637050628662109375f, pio2_lo_asin = -4.37113900018624283e-8f, pio4_hi_asin = 0.785398185253143310546875f, pS0_asin = 1.6666667163e-01, pS1_asin = -3.2556581497e-01, pS2_asin = 2.0121252537e-01, pS3_asin = -4.0055535734e-02, pS4_asin = 7.9153501429e-04, pS5_asin = 3.4793309169e-05, qS1_asin = -2.4033949375e+00, qS2_asin = 2.0209457874e+00, qS3_asin = -6.8828397989e-01, qS4_asin = 7.7038154006e-02; VAL [huge_asin=1000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000] [L185] float x = 0.0f / 0.0f; [L186] CALL __ieee754_asinf(x) [L111] float t, w, p, q, c, r, s; [L112] __int32_t hx, ix; VAL [\old(x)=1000000000000000000000000000018, huge_asin=1000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000018] [L114] ieee_float_shape_type gf_u; [L115] gf_u.value = (x) [L116] EXPR gf_u.word [L116] (hx) = gf_u.word [L118] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000018, huge_asin=1000000000000000000000000000000, hx=0, ix=0, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000018] [L119] COND FALSE !(ix == 0x3f800000) VAL [\old(x)=1000000000000000000000000000018, huge_asin=1000000000000000000000000000000, hx=0, ix=0, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000018] [L122] COND FALSE !(ix > 0x3f800000) VAL [\old(x)=1000000000000000000000000000018, huge_asin=1000000000000000000000000000000, hx=0, ix=0, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000018] [L124] COND TRUE ix < 0x3f000000 VAL [\old(x)=1000000000000000000000000000018, huge_asin=1000000000000000000000000000000, hx=0, ix=0, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000018] [L125] COND TRUE ix < 0x32000000 VAL [\old(x)=1000000000000000000000000000018, huge_asin=1000000000000000000000000000000, hx=0, ix=0, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000018] [L126] COND FALSE !(huge_asin + x > one_asin) VAL [\old(x)=1000000000000000000000000000018, huge_asin=1000000000000000000000000000000, hx=0, ix=0, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000018] [L141] CALL, EXPR fabs_float(x) [L86] __uint32_t ix; VAL [\old(x)=1000000000000000000000000000018, huge_asin=1000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000018] [L88] ieee_float_shape_type gf_u; [L89] gf_u.value = (x) [L90] EXPR gf_u.word [L90] (ix) = gf_u.word [L93] ieee_float_shape_type sf_u; [L94] sf_u.word = (ix & 0x7fffffff) [L95] EXPR sf_u.value [L95] (x) = sf_u.value [L97] return x; VAL [\old(x)=1000000000000000000000000000018, \result=1000000000000000000000000000020, huge_asin=1000000000000000000000000000000, ix=1073741825, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000020] [L141] RET, EXPR fabs_float(x) [L141] w = one_asin - fabs_float(x) [L142] t = w * (float)0.5 [L143-L146] p = t * (pS0_asin + t * (pS1_asin + t * (pS2_asin + t * (pS3_asin + t * (pS4_asin + t * pS5_asin))))) [L147-L148] q = one_asin + t * (qS1_asin + t * (qS2_asin + t * (qS3_asin + t * qS4_asin))) [L149] CALL __ieee754_sqrtf(t) [L20] float z; [L21] __uint32_t r, hx; [L22] __int32_t ix, s, q, m, t, i; VAL [\old(x)=1000000000000000000000000000019, huge_asin=1000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000019] [L25] ieee_float_shape_type gf_u; [L26] gf_u.value = (x) [L27] EXPR gf_u.word [L27] (ix) = gf_u.word [L29] hx = ix & 0x7fffffff VAL [\old(x)=1000000000000000000000000000019, huge_asin=1000000000000000000000000000000, hx=8388608, hx = ix & 0x7fffffff=2147483647, ix=2147483647, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000019] [L31] COND FALSE !(!((hx) < 0x7f800000L)) VAL [\old(x)=1000000000000000000000000000019, huge_asin=1000000000000000000000000000000, hx=8388608, hx = ix & 0x7fffffff=2147483647, ix=2147483647, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000019] [L34] COND FALSE !(((hx) == 0)) VAL [\old(x)=1000000000000000000000000000019, huge_asin=1000000000000000000000000000000, hx=8388608, hx = ix & 0x7fffffff=2147483647, ix=2147483647, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000019] [L36] COND FALSE !(ix < 0) [L39] m = (ix >> 23) VAL [\old(x)=1000000000000000000000000000019, huge_asin=1000000000000000000000000000000, hx=8388608, hx = ix & 0x7fffffff=2147483647, ix=2147483647, m=255, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000019] [L40] COND FALSE !(((hx) < 0x00800000L)) VAL [\old(x)=1000000000000000000000000000019, huge_asin=1000000000000000000000000000000, hx=8388608, hx = ix & 0x7fffffff=2147483647, ix=2147483647, m=255, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000019] [L45] m -= 127 VAL [\old(x)=1000000000000000000000000000019, huge_asin=1000000000000000000000000000000, hx=8388608, hx = ix & 0x7fffffff=2147483647, ix=2147483647, m=128, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000019] [L46] ix = (ix & 0x007fffffL) | 0x00800000L VAL [\old(x)=1000000000000000000000000000019, huge_asin=1000000000000000000000000000000, hx=8388608, hx = ix & 0x7fffffff=2147483647, ix=1073741824, m=128, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000019] [L47] COND TRUE m & 1 VAL [\old(x)=1000000000000000000000000000019, huge_asin=1000000000000000000000000000000, hx=8388608, hx = ix & 0x7fffffff=2147483647, ix=1073741824, m=128, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000019] [L48] ix += ix VAL [\old(x)=1000000000000000000000000000019, huge_asin=1000000000000000000000000000000, hx=8388608, hx = ix & 0x7fffffff=2147483647, ix=1073741824, m=128, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000019] - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: 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: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: 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, 112 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1160 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1160 mSDsluCounter, 3980 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2699 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 976 IncrementalHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 1281 mSDtfsCounter, 976 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=10, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1110 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 405 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 387 ConstructedInterpolants, 0 QuantifiedInterpolants, 690 SizeOfPredicates, 4 NumberOfNonLiveVariables, 371 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 4/17 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-15 20:49:23,147 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...