/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_0970b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 12:03:08,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 12:03:08,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 12:03:08,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 12:03:08,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 12:03:08,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 12:03:08,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 12:03:08,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 12:03:08,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 12:03:08,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 12:03:08,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 12:03:08,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 12:03:08,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 12:03:08,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 12:03:08,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 12:03:08,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 12:03:08,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 12:03:08,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 12:03:08,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 12:03:08,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 12:03:08,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 12:03:08,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 12:03:08,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 12:03:08,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 12:03:08,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 12:03:08,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 12:03:08,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 12:03:08,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 12:03:08,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 12:03:08,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 12:03:08,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 12:03:08,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 12:03:08,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 12:03:08,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 12:03:08,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 12:03:08,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 12:03:08,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 12:03:08,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 12:03:08,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 12:03:08,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 12:03:08,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 12:03:08,275 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 12:03:08,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 12:03:08,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 12:03:08,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 12:03:08,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 12:03:08,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 12:03:08,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 12:03:08,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 12:03:08,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 12:03:08,312 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 12:03:08,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 12:03:08,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 12:03:08,313 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 12:03:08,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 12:03:08,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 12:03:08,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 12:03:08,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 12:03:08,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 12:03:08,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 12:03:08,314 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 12:03:08,314 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 12:03:08,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 12:03:08,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 12:03:08,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 12:03:08,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 12:03:08,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 12:03:08,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 12:03:08,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:03:08,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 12:03:08,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 12:03:08,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 12:03:08,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 12:03:08,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 12:03:08,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 12:03:08,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 12:03:08,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 12:03:08,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 12:03:08,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 12:03:08,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 12:03:08,710 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 12:03:08,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0970b.c [2022-10-16 12:03:08,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebb182b3/8e0ba548c70c40109b976f8c4a2a1df8/FLAGdd74a910b [2022-10-16 12:03:09,374 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 12:03:09,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0970b.c [2022-10-16 12:03:09,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebb182b3/8e0ba548c70c40109b976f8c4a2a1df8/FLAGdd74a910b [2022-10-16 12:03:09,743 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebb182b3/8e0ba548c70c40109b976f8c4a2a1df8 [2022-10-16 12:03:09,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 12:03:09,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 12:03:09,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 12:03:09,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 12:03:09,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 12:03:09,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:03:09" (1/1) ... [2022-10-16 12:03:09,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@196202eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:09, skipping insertion in model container [2022-10-16 12:03:09,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:03:09" (1/1) ... [2022-10-16 12:03:09,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 12:03:09,818 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 12:03:10,101 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_0970b.c[4118,4131] [2022-10-16 12:03:10,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:03:10,112 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 12:03:10,168 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_0970b.c[4118,4131] [2022-10-16 12:03:10,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:03:10,193 INFO L208 MainTranslator]: Completed translation [2022-10-16 12:03:10,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10 WrapperNode [2022-10-16 12:03:10,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 12:03:10,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 12:03:10,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 12:03:10,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 12:03:10,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10" (1/1) ... [2022-10-16 12:03:10,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10" (1/1) ... [2022-10-16 12:03:10,258 INFO L138 Inliner]: procedures = 18, calls = 34, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 262 [2022-10-16 12:03:10,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 12:03:10,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 12:03:10,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 12:03:10,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 12:03:10,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10" (1/1) ... [2022-10-16 12:03:10,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10" (1/1) ... [2022-10-16 12:03:10,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10" (1/1) ... [2022-10-16 12:03:10,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10" (1/1) ... [2022-10-16 12:03:10,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10" (1/1) ... [2022-10-16 12:03:10,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10" (1/1) ... [2022-10-16 12:03:10,340 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10" (1/1) ... [2022-10-16 12:03:10,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10" (1/1) ... [2022-10-16 12:03:10,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 12:03:10,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 12:03:10,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 12:03:10,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 12:03:10,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10" (1/1) ... [2022-10-16 12:03:10,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:03:10,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:03:10,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 12:03:10,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 12:03:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 12:03:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 12:03:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 12:03:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 12:03:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 12:03:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 12:03:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 12:03:10,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 12:03:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 12:03:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 12:03:10,604 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 12:03:10,607 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 12:03:11,213 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 12:03:11,222 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 12:03:11,222 INFO L300 CfgBuilder]: Removed 12 assume(true) statements. [2022-10-16 12:03:11,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:03:11 BoogieIcfgContainer [2022-10-16 12:03:11,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 12:03:11,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 12:03:11,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 12:03:11,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 12:03:11,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:03:09" (1/3) ... [2022-10-16 12:03:11,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335dac24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:03:11, skipping insertion in model container [2022-10-16 12:03:11,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:10" (2/3) ... [2022-10-16 12:03:11,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335dac24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:03:11, skipping insertion in model container [2022-10-16 12:03:11,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:03:11" (3/3) ... [2022-10-16 12:03:11,235 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0970b.c [2022-10-16 12:03:11,256 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 12:03:11,256 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-10-16 12:03:11,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 12:03:11,323 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;@1e2f8e69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 12:03:11,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2022-10-16 12:03:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 110 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 12:03:11,335 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:11,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:11,337 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:11,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:11,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1904531819, now seen corresponding path program 1 times [2022-10-16 12:03:11,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:11,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419698872] [2022-10-16 12:03:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:11,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:11,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:11,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419698872] [2022-10-16 12:03:11,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419698872] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:11,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:11,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:11,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625263937] [2022-10-16 12:03:11,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:11,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 12:03:11,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:11,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 12:03:11,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:03:11,574 INFO L87 Difference]: Start difference. First operand has 111 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 110 states have internal predecessors, (146), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:11,606 INFO L93 Difference]: Finished difference Result 220 states and 290 transitions. [2022-10-16 12:03:11,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 12:03:11,608 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-10-16 12:03:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:11,620 INFO L225 Difference]: With dead ends: 220 [2022-10-16 12:03:11,620 INFO L226 Difference]: Without dead ends: 98 [2022-10-16 12:03:11,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:03:11,628 INFO L413 NwaCegarLoop]: 131 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, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:11,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-16 12:03:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-10-16 12:03:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-10-16 12:03:11,675 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 9 [2022-10-16 12:03:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:11,676 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-10-16 12:03:11,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-10-16 12:03:11,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 12:03:11,677 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:11,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:11,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 12:03:11,678 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:11,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1483818994, now seen corresponding path program 1 times [2022-10-16 12:03:11,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:11,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735888581] [2022-10-16 12:03:11,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:11,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:11,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:11,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735888581] [2022-10-16 12:03:11,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735888581] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:11,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:11,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:11,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340744069] [2022-10-16 12:03:11,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:11,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:11,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:11,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:11,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:11,819 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:11,859 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-10-16 12:03:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:11,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-16 12:03:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:11,861 INFO L225 Difference]: With dead ends: 106 [2022-10-16 12:03:11,862 INFO L226 Difference]: Without dead ends: 104 [2022-10-16 12:03:11,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:11,864 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:11,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 183 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:11,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-10-16 12:03:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2022-10-16 12:03:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 95 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-10-16 12:03:11,883 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 10 [2022-10-16 12:03:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:11,883 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-10-16 12:03:11,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-10-16 12:03:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 12:03:11,884 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:11,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:11,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 12:03:11,885 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:11,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:11,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1483819571, now seen corresponding path program 1 times [2022-10-16 12:03:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:11,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069652431] [2022-10-16 12:03:11,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:11,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:12,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:12,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069652431] [2022-10-16 12:03:12,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069652431] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:12,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:12,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:12,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417561948] [2022-10-16 12:03:12,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:12,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:12,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:12,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:12,061 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:12,184 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2022-10-16 12:03:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:12,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-16 12:03:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:12,190 INFO L225 Difference]: With dead ends: 178 [2022-10-16 12:03:12,191 INFO L226 Difference]: Without dead ends: 177 [2022-10-16 12:03:12,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:12,195 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 87 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:12,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 161 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-10-16 12:03:12,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2022-10-16 12:03:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 96 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:12,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-10-16 12:03:12,218 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 10 [2022-10-16 12:03:12,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:12,218 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-10-16 12:03:12,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-10-16 12:03:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 12:03:12,220 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:12,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:12,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 12:03:12,221 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:12,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:12,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1246233469, now seen corresponding path program 1 times [2022-10-16 12:03:12,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:12,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044972291] [2022-10-16 12:03:12,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:12,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:12,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:12,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044972291] [2022-10-16 12:03:12,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044972291] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:12,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:12,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:12,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041438529] [2022-10-16 12:03:12,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:12,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:12,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:12,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:12,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:12,300 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:12,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:12,374 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2022-10-16 12:03:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:12,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-10-16 12:03:12,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:12,377 INFO L225 Difference]: With dead ends: 178 [2022-10-16 12:03:12,377 INFO L226 Difference]: Without dead ends: 177 [2022-10-16 12:03:12,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:12,380 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 82 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:12,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 223 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-10-16 12:03:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 98. [2022-10-16 12:03:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-10-16 12:03:12,405 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 11 [2022-10-16 12:03:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:12,405 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-10-16 12:03:12,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-10-16 12:03:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 12:03:12,407 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:12,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:12,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 12:03:12,407 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:12,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:12,413 INFO L85 PathProgramCache]: Analyzing trace with hash 21468213, now seen corresponding path program 1 times [2022-10-16 12:03:12,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:12,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456797511] [2022-10-16 12:03:12,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:12,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:12,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:12,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456797511] [2022-10-16 12:03:12,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456797511] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:12,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:12,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:03:12,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915155457] [2022-10-16 12:03:12,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:12,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:03:12,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:12,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:03:12,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:03:12,513 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:12,620 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-10-16 12:03:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:03:12,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 12:03:12,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:12,622 INFO L225 Difference]: With dead ends: 102 [2022-10-16 12:03:12,623 INFO L226 Difference]: Without dead ends: 101 [2022-10-16 12:03:12,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:03:12,625 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 7 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:12,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 251 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:12,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-10-16 12:03:12,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-10-16 12:03:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.536231884057971) internal successors, (106), 98 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-10-16 12:03:12,636 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 12 [2022-10-16 12:03:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:12,636 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-10-16 12:03:12,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-10-16 12:03:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 12:03:12,637 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:12,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:12,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 12:03:12,638 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:12,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:12,639 INFO L85 PathProgramCache]: Analyzing trace with hash 665514693, now seen corresponding path program 1 times [2022-10-16 12:03:12,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:12,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127683920] [2022-10-16 12:03:12,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:12,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:12,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:12,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127683920] [2022-10-16 12:03:12,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127683920] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:12,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:12,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:03:12,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239669717] [2022-10-16 12:03:12,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:12,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:03:12,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:12,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:03:12,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:03:12,811 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:12,879 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-10-16 12:03:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:03:12,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-10-16 12:03:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:12,881 INFO L225 Difference]: With dead ends: 101 [2022-10-16 12:03:12,881 INFO L226 Difference]: Without dead ends: 100 [2022-10-16 12:03:12,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:03:12,884 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 7 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:12,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 251 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-16 12:03:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-10-16 12:03:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 99 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-10-16 12:03:12,893 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 13 [2022-10-16 12:03:12,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:12,894 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-10-16 12:03:12,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-10-16 12:03:12,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 12:03:12,895 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:12,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:12,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 12:03:12,896 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:12,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:12,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1377335361, now seen corresponding path program 1 times [2022-10-16 12:03:12,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:12,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595231256] [2022-10-16 12:03:12,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:12,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595231256] [2022-10-16 12:03:13,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595231256] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:13,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:13,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507292840] [2022-10-16 12:03:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:13,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:13,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:13,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:13,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:13,017 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:13,060 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2022-10-16 12:03:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:13,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 12:03:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:13,064 INFO L225 Difference]: With dead ends: 155 [2022-10-16 12:03:13,065 INFO L226 Difference]: Without dead ends: 154 [2022-10-16 12:03:13,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:13,076 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 93 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:13,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 138 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-10-16 12:03:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 99. [2022-10-16 12:03:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 98 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-10-16 12:03:13,100 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 14 [2022-10-16 12:03:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:13,101 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-10-16 12:03:13,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-10-16 12:03:13,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 12:03:13,106 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:13,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:13,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 12:03:13,107 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:13,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:13,108 INFO L85 PathProgramCache]: Analyzing trace with hash -843880905, now seen corresponding path program 1 times [2022-10-16 12:03:13,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:13,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385844729] [2022-10-16 12:03:13,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:13,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:13,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:13,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385844729] [2022-10-16 12:03:13,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385844729] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:13,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:13,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:13,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333419613] [2022-10-16 12:03:13,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:13,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:13,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:13,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:13,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:13,300 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:13,333 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-10-16 12:03:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:13,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 12:03:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:13,334 INFO L225 Difference]: With dead ends: 99 [2022-10-16 12:03:13,335 INFO L226 Difference]: Without dead ends: 95 [2022-10-16 12:03:13,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:13,336 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 77 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:13,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 93 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-10-16 12:03:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-10-16 12:03:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.457142857142857) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-10-16 12:03:13,344 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 14 [2022-10-16 12:03:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:13,345 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-10-16 12:03:13,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-10-16 12:03:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:03:13,346 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:13,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:13,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 12:03:13,347 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:13,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash 252276855, now seen corresponding path program 1 times [2022-10-16 12:03:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:13,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505277955] [2022-10-16 12:03:13,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:13,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:13,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:13,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505277955] [2022-10-16 12:03:13,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505277955] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:13,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:13,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611180514] [2022-10-16 12:03:13,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:13,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:13,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:13,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:13,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:13,431 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:13,475 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2022-10-16 12:03:13,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:13,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-16 12:03:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:13,477 INFO L225 Difference]: With dead ends: 150 [2022-10-16 12:03:13,477 INFO L226 Difference]: Without dead ends: 149 [2022-10-16 12:03:13,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:13,479 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 87 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:13,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 134 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-10-16 12:03:13,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 94. [2022-10-16 12:03:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-10-16 12:03:13,487 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 15 [2022-10-16 12:03:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:13,487 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-10-16 12:03:13,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-10-16 12:03:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:03:13,488 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:13,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:13,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 12:03:13,489 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:13,490 INFO L85 PathProgramCache]: Analyzing trace with hash -390504185, now seen corresponding path program 1 times [2022-10-16 12:03:13,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:13,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391306231] [2022-10-16 12:03:13,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:13,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:13,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:13,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391306231] [2022-10-16 12:03:13,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391306231] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:13,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:13,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:13,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248543849] [2022-10-16 12:03:13,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:13,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:13,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:13,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:13,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:13,620 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:13,655 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2022-10-16 12:03:13,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:13,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-16 12:03:13,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:13,656 INFO L225 Difference]: With dead ends: 149 [2022-10-16 12:03:13,656 INFO L226 Difference]: Without dead ends: 90 [2022-10-16 12:03:13,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:13,658 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 69 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:13,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 91 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-16 12:03:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-10-16 12:03:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 89 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-10-16 12:03:13,664 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 15 [2022-10-16 12:03:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:13,664 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-10-16 12:03:13,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-10-16 12:03:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 12:03:13,665 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:13,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:13,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 12:03:13,666 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:13,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash -769351999, now seen corresponding path program 1 times [2022-10-16 12:03:13,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:13,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638334090] [2022-10-16 12:03:13,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:13,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:13,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:13,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638334090] [2022-10-16 12:03:13,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638334090] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:13,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:13,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:03:13,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570965087] [2022-10-16 12:03:13,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:13,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:03:13,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:13,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:03:13,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:03:13,790 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:13,860 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-10-16 12:03:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:03:13,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-16 12:03:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:13,864 INFO L225 Difference]: With dead ends: 90 [2022-10-16 12:03:13,864 INFO L226 Difference]: Without dead ends: 89 [2022-10-16 12:03:13,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:03:13,866 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 16 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:13,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 285 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-16 12:03:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-10-16 12:03:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 88 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-10-16 12:03:13,882 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 16 [2022-10-16 12:03:13,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:13,882 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-10-16 12:03:13,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-10-16 12:03:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 12:03:13,883 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:13,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:13,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 12:03:13,886 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1919891897, now seen corresponding path program 1 times [2022-10-16 12:03:13,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:13,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818368738] [2022-10-16 12:03:13,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:13,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:14,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:14,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818368738] [2022-10-16 12:03:14,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818368738] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:14,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:14,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:03:14,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093424345] [2022-10-16 12:03:14,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:14,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:03:14,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:14,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:03:14,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:03:14,004 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:14,077 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-10-16 12:03:14,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 12:03:14,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-10-16 12:03:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:14,079 INFO L225 Difference]: With dead ends: 89 [2022-10-16 12:03:14,079 INFO L226 Difference]: Without dead ends: 88 [2022-10-16 12:03:14,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:03:14,081 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 18 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:14,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 281 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:14,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-10-16 12:03:14,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2022-10-16 12:03:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 83 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:14,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-10-16 12:03:14,092 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 17 [2022-10-16 12:03:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:14,092 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-10-16 12:03:14,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-10-16 12:03:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 12:03:14,096 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:14,096 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-16 12:03:14,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 12:03:14,098 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:14,099 INFO L85 PathProgramCache]: Analyzing trace with hash 3907146, now seen corresponding path program 1 times [2022-10-16 12:03:14,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:14,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031718597] [2022-10-16 12:03:14,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:14,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:14,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:14,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031718597] [2022-10-16 12:03:14,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031718597] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:14,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:14,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:03:14,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296137150] [2022-10-16 12:03:14,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:14,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 12:03:14,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:14,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 12:03:14,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:03:14,263 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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-16 12:03:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:14,352 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2022-10-16 12:03:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:03:14,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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-16 12:03:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:14,355 INFO L225 Difference]: With dead ends: 155 [2022-10-16 12:03:14,355 INFO L226 Difference]: Without dead ends: 154 [2022-10-16 12:03:14,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:03:14,357 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 142 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:14,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 254 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-10-16 12:03:14,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 101. [2022-10-16 12:03:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-10-16 12:03:14,364 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 26 [2022-10-16 12:03:14,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:14,364 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-10-16 12:03:14,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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-16 12:03:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-10-16 12:03:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 12:03:14,368 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:14,368 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-16 12:03:14,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 12:03:14,369 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:14,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:14,370 INFO L85 PathProgramCache]: Analyzing trace with hash 121121657, now seen corresponding path program 1 times [2022-10-16 12:03:14,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:14,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449093723] [2022-10-16 12:03:14,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:14,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:14,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449093723] [2022-10-16 12:03:14,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449093723] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:14,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:14,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:03:14,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936296330] [2022-10-16 12:03:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:14,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 12:03:14,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:14,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 12:03:14,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:03:14,543 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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-16 12:03:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:14,637 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2022-10-16 12:03:14,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:03:14,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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-16 12:03:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:14,639 INFO L225 Difference]: With dead ends: 154 [2022-10-16 12:03:14,639 INFO L226 Difference]: Without dead ends: 153 [2022-10-16 12:03:14,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:03:14,640 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 137 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:14,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 259 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:14,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-10-16 12:03:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 102. [2022-10-16 12:03:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-10-16 12:03:14,647 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 27 [2022-10-16 12:03:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:14,648 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-10-16 12:03:14,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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-16 12:03:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-10-16 12:03:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 12:03:14,649 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:14,649 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] [2022-10-16 12:03:14,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 12:03:14,650 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:14,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:14,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1081951190, now seen corresponding path program 1 times [2022-10-16 12:03:14,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:14,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904153212] [2022-10-16 12:03:14,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:14,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:14,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904153212] [2022-10-16 12:03:14,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904153212] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:14,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:14,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 12:03:14,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557580214] [2022-10-16 12:03:14,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:14,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 12:03:14,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:14,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 12:03:14,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:03:14,869 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:14,992 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-10-16 12:03:14,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 12:03:14,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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 30 [2022-10-16 12:03:14,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:14,994 INFO L225 Difference]: With dead ends: 102 [2022-10-16 12:03:14,994 INFO L226 Difference]: Without dead ends: 101 [2022-10-16 12:03:14,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-10-16 12:03:14,996 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 147 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:14,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 242 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:14,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-10-16 12:03:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-10-16 12:03:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-10-16 12:03:15,003 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 30 [2022-10-16 12:03:15,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:15,004 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-10-16 12:03:15,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-10-16 12:03:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-16 12:03:15,005 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:15,005 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-16 12:03:15,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 12:03:15,006 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:15,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash -819251347, now seen corresponding path program 1 times [2022-10-16 12:03:15,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:15,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298709348] [2022-10-16 12:03:15,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:15,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:15,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:15,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298709348] [2022-10-16 12:03:15,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298709348] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:15,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:15,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 12:03:15,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403957864] [2022-10-16 12:03:15,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:15,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 12:03:15,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:15,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 12:03:15,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:03:15,186 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 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-16 12:03:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:15,293 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-10-16 12:03:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:03:15,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 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-16 12:03:15,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:15,296 INFO L225 Difference]: With dead ends: 101 [2022-10-16 12:03:15,296 INFO L226 Difference]: Without dead ends: 100 [2022-10-16 12:03:15,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-16 12:03:15,297 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 141 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:15,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 240 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-16 12:03:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2022-10-16 12:03:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.303030303030303) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-10-16 12:03:15,304 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 31 [2022-10-16 12:03:15,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:15,305 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-10-16 12:03:15,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 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-16 12:03:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-10-16 12:03:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-16 12:03:15,306 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:15,307 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, 1, 1, 1] [2022-10-16 12:03:15,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 12:03:15,308 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:15,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:15,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1518509379, now seen corresponding path program 1 times [2022-10-16 12:03:15,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:15,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338850781] [2022-10-16 12:03:15,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:15,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:15,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:15,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338850781] [2022-10-16 12:03:15,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338850781] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:15,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:15,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:15,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429406262] [2022-10-16 12:03:15,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:15,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:15,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:15,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:15,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:15,386 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:15,411 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-10-16 12:03:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:15,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2022-10-16 12:03:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:15,412 INFO L225 Difference]: With dead ends: 90 [2022-10-16 12:03:15,412 INFO L226 Difference]: Without dead ends: 88 [2022-10-16 12:03:15,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:15,414 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:15,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 145 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-10-16 12:03:15,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2022-10-16 12:03:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-10-16 12:03:15,425 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 38 [2022-10-16 12:03:15,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:15,425 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-10-16 12:03:15,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-10-16 12:03:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-16 12:03:15,426 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:15,426 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, 1, 1, 1] [2022-10-16 12:03:15,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 12:03:15,426 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1518509956, now seen corresponding path program 1 times [2022-10-16 12:03:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:15,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891559787] [2022-10-16 12:03:15,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:15,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:15,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891559787] [2022-10-16 12:03:15,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891559787] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:15,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:15,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:15,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866478588] [2022-10-16 12:03:15,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:15,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:15,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:15,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:15,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:15,510 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:15,567 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-10-16 12:03:15,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:15,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2022-10-16 12:03:15,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:15,568 INFO L225 Difference]: With dead ends: 103 [2022-10-16 12:03:15,568 INFO L226 Difference]: Without dead ends: 98 [2022-10-16 12:03:15,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:15,569 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:15,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 110 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-16 12:03:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2022-10-16 12:03:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 90 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-10-16 12:03:15,576 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 38 [2022-10-16 12:03:15,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:15,577 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-10-16 12:03:15,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,577 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-10-16 12:03:15,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-16 12:03:15,578 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:15,578 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, 1, 1, 1, 1] [2022-10-16 12:03:15,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-16 12:03:15,578 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:15,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:15,579 INFO L85 PathProgramCache]: Analyzing trace with hash -170831422, now seen corresponding path program 1 times [2022-10-16 12:03:15,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:15,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309461172] [2022-10-16 12:03:15,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:15,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:15,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:15,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309461172] [2022-10-16 12:03:15,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309461172] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:15,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:15,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:15,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564585851] [2022-10-16 12:03:15,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:15,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:15,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:15,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:15,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:15,654 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:15,698 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-10-16 12:03:15,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:15,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2022-10-16 12:03:15,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:15,699 INFO L225 Difference]: With dead ends: 97 [2022-10-16 12:03:15,699 INFO L226 Difference]: Without dead ends: 96 [2022-10-16 12:03:15,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:15,700 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:15,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 125 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:15,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-10-16 12:03:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-10-16 12:03:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 91 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-10-16 12:03:15,707 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 39 [2022-10-16 12:03:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:15,708 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-10-16 12:03:15,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-10-16 12:03:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 12:03:15,709 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:15,709 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, 1, 1, 1, 1, 1] [2022-10-16 12:03:15,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-16 12:03:15,709 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:15,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:15,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1000806586, now seen corresponding path program 1 times [2022-10-16 12:03:15,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:15,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350608532] [2022-10-16 12:03:15,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:15,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:15,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:15,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350608532] [2022-10-16 12:03:15,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350608532] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:15,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:15,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:03:15,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096783750] [2022-10-16 12:03:15,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:15,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:03:15,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:15,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:03:15,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:03:15,822 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:15,894 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-10-16 12:03:15,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:03:15,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2022-10-16 12:03:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:15,895 INFO L225 Difference]: With dead ends: 96 [2022-10-16 12:03:15,896 INFO L226 Difference]: Without dead ends: 95 [2022-10-16 12:03:15,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:03:15,897 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:15,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 182 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-10-16 12:03:15,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2022-10-16 12:03:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 92 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-10-16 12:03:15,904 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 40 [2022-10-16 12:03:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:15,904 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-10-16 12:03:15,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-10-16 12:03:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 12:03:15,905 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:15,905 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, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:15,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-16 12:03:15,906 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:15,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash -960232892, now seen corresponding path program 1 times [2022-10-16 12:03:15,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:15,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078337772] [2022-10-16 12:03:15,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:15,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:16,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:16,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078337772] [2022-10-16 12:03:16,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078337772] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:16,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:16,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:03:16,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567042650] [2022-10-16 12:03:16,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:16,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:03:16,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:16,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:03:16,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:03:16,004 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:16,073 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-10-16 12:03:16,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:03:16,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2022-10-16 12:03:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:16,075 INFO L225 Difference]: With dead ends: 95 [2022-10-16 12:03:16,075 INFO L226 Difference]: Without dead ends: 94 [2022-10-16 12:03:16,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:03:16,076 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:16,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 182 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:03:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-10-16 12:03:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-10-16 12:03:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.275) internal successors, (102), 93 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2022-10-16 12:03:16,084 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 41 [2022-10-16 12:03:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:16,084 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2022-10-16 12:03:16,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-10-16 12:03:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 12:03:16,085 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:16,085 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, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:16,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-16 12:03:16,086 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:16,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:16,086 INFO L85 PathProgramCache]: Analyzing trace with hash -235902832, now seen corresponding path program 1 times [2022-10-16 12:03:16,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:16,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822207360] [2022-10-16 12:03:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:16,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:03:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:03:16,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:03:16,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822207360] [2022-10-16 12:03:16,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822207360] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:03:16,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:03:16,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:03:16,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340206240] [2022-10-16 12:03:16,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:03:16,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:03:16,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:03:16,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:03:16,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:16,198 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:03:16,236 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-10-16 12:03:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:03:16,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2022-10-16 12:03:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:03:16,238 INFO L225 Difference]: With dead ends: 94 [2022-10-16 12:03:16,238 INFO L226 Difference]: Without dead ends: 93 [2022-10-16 12:03:16,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:03:16,239 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 41 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:03:16,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 87 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:03:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-10-16 12:03:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-10-16 12:03:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.2625) internal successors, (101), 92 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-10-16 12:03:16,246 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 42 [2022-10-16 12:03:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:03:16,247 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-10-16 12:03:16,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:03:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-10-16 12:03:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 12:03:16,247 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:03:16,248 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, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:03:16,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-16 12:03:16,248 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2022-10-16 12:03:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:03:16,248 INFO L85 PathProgramCache]: Analyzing trace with hash 297551624, now seen corresponding path program 1 times [2022-10-16 12:03:16,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:03:16,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969649111] [2022-10-16 12:03:16,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:03:16,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:03:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:03:16,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 12:03:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:03:16,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 12:03:16,352 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 12:03:16,354 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 32 remaining) [2022-10-16 12:03:16,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 32 remaining) [2022-10-16 12:03:16,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 32 remaining) [2022-10-16 12:03:16,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 32 remaining) [2022-10-16 12:03:16,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 32 remaining) [2022-10-16 12:03:16,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 32 remaining) [2022-10-16 12:03:16,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 32 remaining) [2022-10-16 12:03:16,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 32 remaining) [2022-10-16 12:03:16,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 32 remaining) [2022-10-16 12:03:16,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 32 remaining) [2022-10-16 12:03:16,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 32 remaining) [2022-10-16 12:03:16,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 32 remaining) [2022-10-16 12:03:16,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 32 remaining) [2022-10-16 12:03:16,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 32 remaining) [2022-10-16 12:03:16,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 32 remaining) [2022-10-16 12:03:16,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 32 remaining) [2022-10-16 12:03:16,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 32 remaining) [2022-10-16 12:03:16,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 32 remaining) [2022-10-16 12:03:16,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 32 remaining) [2022-10-16 12:03:16,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 32 remaining) [2022-10-16 12:03:16,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 32 remaining) [2022-10-16 12:03:16,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 32 remaining) [2022-10-16 12:03:16,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 32 remaining) [2022-10-16 12:03:16,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 32 remaining) [2022-10-16 12:03:16,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 32 remaining) [2022-10-16 12:03:16,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 32 remaining) [2022-10-16 12:03:16,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 32 remaining) [2022-10-16 12:03:16,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 32 remaining) [2022-10-16 12:03:16,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 32 remaining) [2022-10-16 12:03:16,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 32 remaining) [2022-10-16 12:03:16,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 32 remaining) [2022-10-16 12:03:16,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 32 remaining) [2022-10-16 12:03:16,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-16 12:03:16,366 INFO L444 BasicCegarLoop]: Path program 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-16 12:03:16,371 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 12:03:16,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:03:16 BoogieIcfgContainer [2022-10-16 12:03:16,457 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 12:03:16,458 INFO L158 Benchmark]: Toolchain (without parser) took 6710.17ms. Allocated memory was 153.1MB in the beginning and 215.0MB in the end (delta: 61.9MB). Free memory was 127.3MB in the beginning and 93.5MB in the end (delta: 33.8MB). Peak memory consumption was 96.6MB. Max. memory is 8.0GB. [2022-10-16 12:03:16,458 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 12:03:16,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.32ms. Allocated memory is still 153.1MB. Free memory was 127.1MB in the beginning and 114.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-16 12:03:16,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.60ms. Allocated memory is still 153.1MB. Free memory was 114.4MB in the beginning and 111.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 12:03:16,459 INFO L158 Benchmark]: Boogie Preprocessor took 96.98ms. Allocated memory is still 153.1MB. Free memory was 111.8MB in the beginning and 109.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 12:03:16,460 INFO L158 Benchmark]: RCFGBuilder took 867.43ms. Allocated memory is still 153.1MB. Free memory was 109.5MB in the beginning and 122.4MB in the end (delta: -12.8MB). Peak memory consumption was 18.4MB. Max. memory is 8.0GB. [2022-10-16 12:03:16,460 INFO L158 Benchmark]: TraceAbstraction took 5230.02ms. Allocated memory was 153.1MB in the beginning and 215.0MB in the end (delta: 61.9MB). Free memory was 121.9MB in the beginning and 93.5MB in the end (delta: 28.4MB). Peak memory consumption was 90.8MB. Max. memory is 8.0GB. [2022-10-16 12:03:16,465 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.19ms. Allocated memory is still 153.1MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 438.32ms. Allocated memory is still 153.1MB. Free memory was 127.1MB in the beginning and 114.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.60ms. Allocated memory is still 153.1MB. Free memory was 114.4MB in the beginning and 111.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 96.98ms. Allocated memory is still 153.1MB. Free memory was 111.8MB in the beginning and 109.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 867.43ms. Allocated memory is still 153.1MB. Free memory was 109.5MB in the beginning and 122.4MB in the end (delta: -12.8MB). Peak memory consumption was 18.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5230.02ms. Allocated memory was 153.1MB in the beginning and 215.0MB in the end (delta: 61.9MB). Free memory was 121.9MB in the beginning and 93.5MB in the end (delta: 28.4MB). Peak memory consumption was 90.8MB. 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: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of to_real at line 136, overapproximation of someBinaryArithmeticFLOAToperation at line 156, overapproximation of bitwiseAnd at line 49. Possible FailurePath: [L14-L18] static const float ln2_hi_log = 6.9313812256e-01, ln2_lo_log = 9.0580006145e-06, two25_log = 3.355443200e+07, Lg1_log = 6.6666668653e-01, Lg2_log = 4.0000000596e-01, Lg3_log = 2.8571429849e-01, Lg4_log = 2.2222198546e-01, Lg5_log = 1.8183572590e-01, Lg6_log = 1.5313838422e-01, Lg7_log = 1.4798198640e-01; [L20] static const float zero_log = 0.0; [L100-L103] static const float two25_log10 = 3.3554432000e+07, ivln10_log10 = 4.3429449201e-01, log10_2hi_log10 = 3.0102920532e-01, log10_2lo_log10 = 7.9034151668e-07; [L105] static const float zero = 0.0; VAL [ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, zero=0, zero_log=0] [L156] float x = -1.0f / 0.0f; [L157] CALL __ieee754_log10f(x) [L108] float y, z; [L109] __int32_t i, k, hx; VAL [\old(x)=4320133137, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L112] ieee_float_shape_type gf_u; [L113] gf_u.value = (x) [L114] EXPR gf_u.word [L114] (hx) = gf_u.word [L117] k = 0 VAL [\old(x)=4320133137, hx=25165823, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L118] COND FALSE !(((hx & 0x7fffffff) == 0)) VAL [\old(x)=4320133137, hx=25165823, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L120] COND FALSE !(hx < 0) VAL [\old(x)=4320133137, hx=25165823, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L122] COND FALSE !(!((hx) < 0x7f800000L)) VAL [\old(x)=4320133137, hx=25165823, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L124] COND FALSE !(((hx) < 0x00800000L)) VAL [\old(x)=4320133137, hx=25165823, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L133] EXPR (hx >> 23) - 127 VAL [\old(x)=4320133137, hx=25165823, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L133] k += (hx >> 23) - 127 [L134] i = ((__uint32_t)k & 0x80000000) >> 31 VAL [\old(x)=4320133137, hx=25165823, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L135] EXPR 0x7f - i VAL [\old(x)=4320133137, hx=25165823, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L135] EXPR (0x7f - i) << 23 VAL [\old(x)=4320133137, hx=25165823, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L135] EXPR 0x7f - i VAL [\old(x)=4320133137, hx=25165823, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L135] EXPR (0x7f - i) << 23 VAL [\old(x)=4320133137, hx=25165823, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L135] hx = (hx & 0x007fffff) | ((0x7f - i) << 23) VAL [\old(x)=4320133137, hx=0, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L136] EXPR k + i [L136] y = (float)(k + i) VAL [\old(x)=4320133137, hx=0, i=0, ivln10_log10=43429449201/100000000000, k=-125, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133137, zero=0, zero_log=0] [L138] ieee_float_shape_type sf_u; [L139] sf_u.word = (hx) [L140] EXPR sf_u.value [L140] (x) = sf_u.value [L142] CALL __ieee754_logf(x) [L23] float hfsq, f, s, z, R, w, t1, t2, dk; [L24] __int32_t k, ix, i, j; VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L27] ieee_float_shape_type gf_u; [L28] gf_u.value = (x) [L29] EXPR gf_u.word [L29] (ix) = gf_u.word [L32] k = 0 VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=16777215, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L33] COND FALSE !(((ix & 0x7fffffff) == 0)) VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=16777215, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L35] COND FALSE !(ix < 0) VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=16777215, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L37] COND FALSE !(!((ix) < 0x7f800000L)) VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=16777215, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L39] COND FALSE !(((ix) < 0x00800000L)) VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=16777215, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L48] EXPR (ix >> 23) - 127 VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=16777215, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L48] k += (ix >> 23) - 127 [L49] ix &= 0x007fffff VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=2142569696, k=-126, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] [L50] ix + (0x95f64 << 3) VAL [\old(x)=4320133136, ivln10_log10=43429449201/100000000000, ix=2142569696, k=-126, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4320133136, zero=0, zero_log=0] - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 136]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 136]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: 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: 48]: 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: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 111 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1211 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1211 mSDsluCounter, 4048 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2259 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 987 IncrementalHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 1789 mSDtfsCounter, 987 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=0, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 426 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 550 NumberOfCodeBlocks, 550 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 486 ConstructedInterpolants, 0 QuantifiedInterpolants, 1142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-16 12:03:16,514 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...