/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 00:43:27,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 00:43:27,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 00:43:27,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 00:43:27,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 00:43:27,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 00:43:27,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 00:43:27,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 00:43:27,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 00:43:27,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 00:43:27,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 00:43:27,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 00:43:27,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 00:43:27,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 00:43:27,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 00:43:27,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 00:43:27,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 00:43:27,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 00:43:27,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 00:43:27,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 00:43:27,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 00:43:27,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 00:43:27,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 00:43:27,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 00:43:27,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 00:43:27,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 00:43:27,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 00:43:27,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 00:43:27,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 00:43:27,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 00:43:27,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 00:43:27,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 00:43:27,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 00:43:27,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 00:43:27,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 00:43:27,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 00:43:27,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 00:43:27,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 00:43:27,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 00:43:27,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 00:43:27,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 00:43:27,750 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-03-31 00:43:27,779 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 00:43:27,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 00:43:27,779 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 00:43:27,779 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 00:43:27,781 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 00:43:27,781 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 00:43:27,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-31 00:43:27,781 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-31 00:43:27,781 INFO L138 SettingsManager]: * Use SBE=true [2023-03-31 00:43:27,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 00:43:27,782 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 00:43:27,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 00:43:27,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 00:43:27,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 00:43:27,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 00:43:27,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 00:43:27,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 00:43:27,783 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 00:43:27,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 00:43:27,783 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 00:43:27,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 00:43:27,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 00:43:27,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-31 00:43:27,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 00:43:27,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 00:43:27,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 00:43:27,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 00:43:27,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 00:43:27,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-31 00:43:27,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 00:43:27,785 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-31 00:43:27,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 00:43:27,785 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-31 00:43:27,785 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-31 00:43:27,785 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-31 00:43:27,785 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-03-31 00:43:27,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 00:43:28,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 00:43:28,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 00:43:28,028 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 00:43:28,029 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 00:43:28,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c [2023-03-31 00:43:29,151 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 00:43:29,336 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 00:43:29,337 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c [2023-03-31 00:43:29,342 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b027622ac/f37fe646dc454c478dfd9509f5013031/FLAG487e6badb [2023-03-31 00:43:29,357 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b027622ac/f37fe646dc454c478dfd9509f5013031 [2023-03-31 00:43:29,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 00:43:29,361 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 00:43:29,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 00:43:29,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 00:43:29,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 00:43:29,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 12:43:29" (1/1) ... [2023-03-31 00:43:29,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359b6a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:43:29, skipping insertion in model container [2023-03-31 00:43:29,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 12:43:29" (1/1) ... [2023-03-31 00:43:29,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 00:43:29,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 00:43:29,532 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c[524,537] [2023-03-31 00:43:29,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 00:43:29,577 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 00:43:29,590 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c[524,537] [2023-03-31 00:43:29,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 00:43:29,625 INFO L208 MainTranslator]: Completed translation [2023-03-31 00:43:29,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:43:29 WrapperNode [2023-03-31 00:43:29,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 00:43:29,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 00:43:29,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 00:43:29,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 00:43:29,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:43:29" (1/1) ... [2023-03-31 00:43:29,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:43:29" (1/1) ... [2023-03-31 00:43:29,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:43:29" (1/1) ... [2023-03-31 00:43:29,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:43:29" (1/1) ... [2023-03-31 00:43:29,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:43:29" (1/1) ... [2023-03-31 00:43:29,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:43:29" (1/1) ... [2023-03-31 00:43:29,649 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:43:29" (1/1) ... [2023-03-31 00:43:29,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:43:29" (1/1) ... [2023-03-31 00:43:29,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 00:43:29,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 00:43:29,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 00:43:29,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 00:43:29,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:43:29" (1/1) ... [2023-03-31 00:43:29,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 00:43:29,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:43:29,681 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) [2023-03-31 00:43:29,685 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 [2023-03-31 00:43:29,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 00:43:29,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 00:43:29,718 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 00:43:29,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-03-31 00:43:29,719 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-03-31 00:43:29,719 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 00:43:29,719 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 00:43:29,719 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 00:43:29,719 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 00:43:29,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 00:43:29,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-03-31 00:43:29,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-03-31 00:43:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-03-31 00:43:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 00:43:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 00:43:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 00:43:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 00:43:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 00:43:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 00:43:29,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 00:43:29,776 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 00:43:29,777 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 00:43:30,039 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 00:43:30,047 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 00:43:30,047 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-03-31 00:43:30,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 12:43:30 BoogieIcfgContainer [2023-03-31 00:43:30,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 00:43:30,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 00:43:30,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 00:43:30,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 00:43:30,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 12:43:29" (1/3) ... [2023-03-31 00:43:30,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382dca75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 12:43:30, skipping insertion in model container [2023-03-31 00:43:30,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:43:29" (2/3) ... [2023-03-31 00:43:30,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382dca75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 12:43:30, skipping insertion in model container [2023-03-31 00:43:30,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 12:43:30" (3/3) ... [2023-03-31 00:43:30,055 INFO L112 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound20.c [2023-03-31 00:43:30,069 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 00:43:30,069 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-31 00:43:30,118 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 00:43:30,123 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=PETRI_NET, 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;@47faadeb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-31 00:43:30,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-31 00:43:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-03-31 00:43:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-03-31 00:43:30,132 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:43:30,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:43:30,133 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:43:30,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:43:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1717894843, now seen corresponding path program 1 times [2023-03-31 00:43:30,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:43:30,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370269617] [2023-03-31 00:43:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:30,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:43:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:43:30,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:43:30,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370269617] [2023-03-31 00:43:30,236 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-03-31 00:43:30,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61717581] [2023-03-31 00:43:30,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:30,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:30,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:43:30,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:43:30,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-03-31 00:43:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:43:30,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2023-03-31 00:43:30,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:43:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:43:30,343 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 00:43:30,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61717581] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:43:30,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:43:30,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-03-31 00:43:30,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198894158] [2023-03-31 00:43:30,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:43:30,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-03-31 00:43:30,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:43:30,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-03-31 00:43:30,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-31 00:43:30,396 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-31 00:43:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:43:30,411 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2023-03-31 00:43:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-31 00:43:30,416 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-03-31 00:43:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:43:30,423 INFO L225 Difference]: With dead ends: 55 [2023-03-31 00:43:30,423 INFO L226 Difference]: Without dead ends: 27 [2023-03-31 00:43:30,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-31 00:43:30,432 INFO L413 NwaCegarLoop]: 38 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, 38 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 [2023-03-31 00:43:30,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:43:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-03-31 00:43:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-03-31 00:43:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-03-31 00:43:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-03-31 00:43:30,480 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2023-03-31 00:43:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:43:30,481 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-03-31 00:43:30,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-31 00:43:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-03-31 00:43:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-03-31 00:43:30,483 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:43:30,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:43:30,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-03-31 00:43:30,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-03-31 00:43:30,692 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:43:30,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:43:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash 444281082, now seen corresponding path program 1 times [2023-03-31 00:43:30,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:43:30,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100784380] [2023-03-31 00:43:30,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:30,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:43:30,714 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 00:43:30,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1290163182] [2023-03-31 00:43:30,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:30,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:30,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:43:30,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:43:30,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-03-31 00:43:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:43:30,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2023-03-31 00:43:30,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:43:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:43:30,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 00:43:30,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:43:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100784380] [2023-03-31 00:43:30,839 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 00:43:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290163182] [2023-03-31 00:43:30,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290163182] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:43:30,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:43:30,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-31 00:43:30,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359891012] [2023-03-31 00:43:30,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:43:30,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 00:43:30,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:43:30,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 00:43:30,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-31 00:43:30,842 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-31 00:43:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:43:30,856 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2023-03-31 00:43:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-31 00:43:30,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-03-31 00:43:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:43:30,857 INFO L225 Difference]: With dead ends: 37 [2023-03-31 00:43:30,857 INFO L226 Difference]: Without dead ends: 29 [2023-03-31 00:43:30,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-31 00:43:30,858 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:43:30,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:43:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-03-31 00:43:30,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-03-31 00:43:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-03-31 00:43:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-03-31 00:43:30,864 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 18 [2023-03-31 00:43:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:43:30,864 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-03-31 00:43:30,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-31 00:43:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-03-31 00:43:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-03-31 00:43:30,865 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:43:30,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:43:30,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-03-31 00:43:31,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-03-31 00:43:31,071 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:43:31,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:43:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash 446068542, now seen corresponding path program 1 times [2023-03-31 00:43:31,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:43:31,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915413201] [2023-03-31 00:43:31,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:31,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:43:31,086 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 00:43:31,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086484364] [2023-03-31 00:43:31,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:31,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:31,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:43:31,090 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:43:31,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-03-31 00:43:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:43:31,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2023-03-31 00:43:31,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:43:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:43:31,257 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 00:43:31,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:43:31,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915413201] [2023-03-31 00:43:31,257 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 00:43:31,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086484364] [2023-03-31 00:43:31,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086484364] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:43:31,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:43:31,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 00:43:31,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521878216] [2023-03-31 00:43:31,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:43:31,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 00:43:31,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:43:31,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 00:43:31,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:43:31,261 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-31 00:43:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:43:31,347 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-03-31 00:43:31,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 00:43:31,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-03-31 00:43:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:43:31,349 INFO L225 Difference]: With dead ends: 42 [2023-03-31 00:43:31,349 INFO L226 Difference]: Without dead ends: 40 [2023-03-31 00:43:31,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-03-31 00:43:31,350 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:43:31,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:43:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-03-31 00:43:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2023-03-31 00:43:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-03-31 00:43:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-03-31 00:43:31,359 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 18 [2023-03-31 00:43:31,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:43:31,359 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-03-31 00:43:31,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-31 00:43:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2023-03-31 00:43:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-03-31 00:43:31,360 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:43:31,360 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:43:31,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-03-31 00:43:31,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:31,566 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:43:31,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:43:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1308579644, now seen corresponding path program 1 times [2023-03-31 00:43:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:43:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178173432] [2023-03-31 00:43:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:31,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:43:31,579 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 00:43:31,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156764126] [2023-03-31 00:43:31,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:31,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:31,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:43:31,582 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:43:31,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-03-31 00:43:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:43:31,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 19 conjunts are in the unsatisfiable core [2023-03-31 00:43:31,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:43:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:43:31,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:43:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:43:32,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:43:32,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178173432] [2023-03-31 00:43:32,035 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 00:43:32,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156764126] [2023-03-31 00:43:32,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156764126] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:43:32,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 00:43:32,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2023-03-31 00:43:32,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286993341] [2023-03-31 00:43:32,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 00:43:32,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-03-31 00:43:32,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:43:32,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-03-31 00:43:32,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-03-31 00:43:32,038 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-03-31 00:43:32,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:43:32,354 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2023-03-31 00:43:32,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-31 00:43:32,355 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 24 [2023-03-31 00:43:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:43:32,360 INFO L225 Difference]: With dead ends: 56 [2023-03-31 00:43:32,361 INFO L226 Difference]: Without dead ends: 52 [2023-03-31 00:43:32,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2023-03-31 00:43:32,368 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 00:43:32,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 172 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 00:43:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-03-31 00:43:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2023-03-31 00:43:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 33 states have internal predecessors, (39), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2023-03-31 00:43:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2023-03-31 00:43:32,393 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 24 [2023-03-31 00:43:32,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:43:32,393 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2023-03-31 00:43:32,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-03-31 00:43:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2023-03-31 00:43:32,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-03-31 00:43:32,395 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:43:32,395 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:43:32,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-03-31 00:43:32,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:32,600 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:43:32,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:43:32,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1797927234, now seen corresponding path program 1 times [2023-03-31 00:43:32,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:43:32,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653945495] [2023-03-31 00:43:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:32,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:43:32,615 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 00:43:32,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394241439] [2023-03-31 00:43:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:32,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:32,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:43:32,633 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:43:32,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-03-31 00:43:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:43:32,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2023-03-31 00:43:32,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:43:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:43:32,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:43:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:43:32,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:43:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653945495] [2023-03-31 00:43:32,789 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 00:43:32,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394241439] [2023-03-31 00:43:32,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394241439] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:43:32,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 00:43:32,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-03-31 00:43:32,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705490550] [2023-03-31 00:43:32,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 00:43:32,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-03-31 00:43:32,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:43:32,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-03-31 00:43:32,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-03-31 00:43:32,793 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-03-31 00:43:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:43:32,865 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2023-03-31 00:43:32,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-03-31 00:43:32,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2023-03-31 00:43:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:43:32,870 INFO L225 Difference]: With dead ends: 111 [2023-03-31 00:43:32,870 INFO L226 Difference]: Without dead ends: 103 [2023-03-31 00:43:32,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-03-31 00:43:32,872 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:43:32,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 151 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:43:32,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-03-31 00:43:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2023-03-31 00:43:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 76 states have internal predecessors, (98), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-03-31 00:43:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. [2023-03-31 00:43:32,896 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 128 transitions. Word has length 27 [2023-03-31 00:43:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:43:32,899 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 128 transitions. [2023-03-31 00:43:32,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-03-31 00:43:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2023-03-31 00:43:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-03-31 00:43:32,900 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:43:32,900 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:43:32,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-03-31 00:43:33,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:33,108 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:43:33,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:43:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1799714694, now seen corresponding path program 1 times [2023-03-31 00:43:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:43:33,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891016455] [2023-03-31 00:43:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:43:33,123 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 00:43:33,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2020508325] [2023-03-31 00:43:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:33,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:33,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:43:33,125 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:43:33,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-03-31 00:43:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:43:33,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 35 conjunts are in the unsatisfiable core [2023-03-31 00:43:33,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:43:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:43:33,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:43:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:43:34,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:43:34,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891016455] [2023-03-31 00:43:34,552 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 00:43:34,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020508325] [2023-03-31 00:43:34,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020508325] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:43:34,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 00:43:34,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-03-31 00:43:34,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89250663] [2023-03-31 00:43:34,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 00:43:34,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-03-31 00:43:34,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:43:34,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-03-31 00:43:34,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-03-31 00:43:34,554 INFO L87 Difference]: Start difference. First operand 99 states and 128 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-03-31 00:43:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:43:36,306 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2023-03-31 00:43:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-03-31 00:43:36,310 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 27 [2023-03-31 00:43:36,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:43:36,312 INFO L225 Difference]: With dead ends: 139 [2023-03-31 00:43:36,312 INFO L226 Difference]: Without dead ends: 133 [2023-03-31 00:43:36,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2023-03-31 00:43:36,313 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 93 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-03-31 00:43:36,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 162 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-03-31 00:43:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-03-31 00:43:36,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 99. [2023-03-31 00:43:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 76 states have internal predecessors, (98), 15 states have call successors, (15), 11 states have call predecessors, (15), 9 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-03-31 00:43:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2023-03-31 00:43:36,344 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 27 [2023-03-31 00:43:36,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:43:36,344 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2023-03-31 00:43:36,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-03-31 00:43:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2023-03-31 00:43:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-03-31 00:43:36,353 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:43:36,354 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:43:36,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-03-31 00:43:36,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:36,554 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:43:36,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:43:36,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2051781490, now seen corresponding path program 1 times [2023-03-31 00:43:36,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:43:36,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626198641] [2023-03-31 00:43:36,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:43:36,564 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 00:43:36,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1146639515] [2023-03-31 00:43:36,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:36,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:36,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:43:36,571 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:43:36,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-03-31 00:43:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:43:36,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2023-03-31 00:43:36,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:43:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-03-31 00:43:36,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 00:43:36,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:43:36,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626198641] [2023-03-31 00:43:36,682 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 00:43:36,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146639515] [2023-03-31 00:43:36,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146639515] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:43:36,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:43:36,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-31 00:43:36,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382002012] [2023-03-31 00:43:36,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:43:36,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-31 00:43:36,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:43:36,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-31 00:43:36,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-31 00:43:36,686 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-03-31 00:43:36,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:43:36,726 INFO L93 Difference]: Finished difference Result 135 states and 168 transitions. [2023-03-31 00:43:36,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-31 00:43:36,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2023-03-31 00:43:36,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:43:36,729 INFO L225 Difference]: With dead ends: 135 [2023-03-31 00:43:36,730 INFO L226 Difference]: Without dead ends: 115 [2023-03-31 00:43:36,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-31 00:43:36,731 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:43:36,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:43:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-03-31 00:43:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2023-03-31 00:43:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 87 states have internal predecessors, (110), 18 states have call successors, (18), 11 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-03-31 00:43:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 143 transitions. [2023-03-31 00:43:36,763 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 143 transitions. Word has length 38 [2023-03-31 00:43:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:43:36,763 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 143 transitions. [2023-03-31 00:43:36,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-03-31 00:43:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 143 transitions. [2023-03-31 00:43:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-03-31 00:43:36,764 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:43:36,764 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:43:36,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-03-31 00:43:36,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:36,971 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:43:36,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:43:36,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1524039145, now seen corresponding path program 1 times [2023-03-31 00:43:36,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:43:36,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302457140] [2023-03-31 00:43:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:36,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:43:36,981 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 00:43:36,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999388923] [2023-03-31 00:43:36,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:36,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:36,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:43:36,983 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:43:36,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-03-31 00:43:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:43:37,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2023-03-31 00:43:37,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:43:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-31 00:43:37,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-03-31 00:43:37,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:43:37,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302457140] [2023-03-31 00:43:37,076 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 00:43:37,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999388923] [2023-03-31 00:43:37,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999388923] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:43:37,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:43:37,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-03-31 00:43:37,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609643584] [2023-03-31 00:43:37,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:43:37,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-03-31 00:43:37,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:43:37,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-03-31 00:43:37,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-03-31 00:43:37,078 INFO L87 Difference]: Start difference. First operand 113 states and 143 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-03-31 00:43:37,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:43:37,164 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2023-03-31 00:43:37,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 00:43:37,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2023-03-31 00:43:37,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:43:37,166 INFO L225 Difference]: With dead ends: 141 [2023-03-31 00:43:37,166 INFO L226 Difference]: Without dead ends: 129 [2023-03-31 00:43:37,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-03-31 00:43:37,168 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:43:37,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 147 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:43:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-03-31 00:43:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2023-03-31 00:43:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 87 states have internal predecessors, (110), 18 states have call successors, (18), 11 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-03-31 00:43:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 143 transitions. [2023-03-31 00:43:37,199 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 143 transitions. Word has length 40 [2023-03-31 00:43:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:43:37,199 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 143 transitions. [2023-03-31 00:43:37,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-03-31 00:43:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 143 transitions. [2023-03-31 00:43:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-03-31 00:43:37,205 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:43:37,205 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:43:37,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-03-31 00:43:37,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-03-31 00:43:37,413 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:43:37,414 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:43:37,414 INFO L85 PathProgramCache]: Analyzing trace with hash -470105561, now seen corresponding path program 1 times [2023-03-31 00:43:37,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:43:37,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562479784] [2023-03-31 00:43:37,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:37,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:43:37,427 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 00:43:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887563820] [2023-03-31 00:43:37,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:37,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:37,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:43:37,431 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:43:37,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-03-31 00:43:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:43:37,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2023-03-31 00:43:37,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:43:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-31 00:43:37,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:43:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-03-31 00:43:37,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:43:37,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562479784] [2023-03-31 00:43:37,628 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 00:43:37,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887563820] [2023-03-31 00:43:37,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887563820] provided 1 perfect and 1 imperfect interpolant sequences [2023-03-31 00:43:37,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-03-31 00:43:37,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-03-31 00:43:37,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979724734] [2023-03-31 00:43:37,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:43:37,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 00:43:37,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:43:37,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 00:43:37,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-03-31 00:43:37,632 INFO L87 Difference]: Start difference. First operand 113 states and 143 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-03-31 00:43:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:43:37,819 INFO L93 Difference]: Finished difference Result 120 states and 149 transitions. [2023-03-31 00:43:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 00:43:37,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-03-31 00:43:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:43:37,821 INFO L225 Difference]: With dead ends: 120 [2023-03-31 00:43:37,821 INFO L226 Difference]: Without dead ends: 100 [2023-03-31 00:43:37,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-03-31 00:43:37,821 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 00:43:37,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 00:43:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-03-31 00:43:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 66. [2023-03-31 00:43:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-03-31 00:43:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2023-03-31 00:43:37,839 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 40 [2023-03-31 00:43:37,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:43:37,841 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2023-03-31 00:43:37,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-03-31 00:43:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2023-03-31 00:43:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-03-31 00:43:37,843 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:43:37,843 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:43:37,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-03-31 00:43:38,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:38,049 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:43:38,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:43:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1818717446, now seen corresponding path program 2 times [2023-03-31 00:43:38,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:43:38,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001439448] [2023-03-31 00:43:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:43:38,059 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 00:43:38,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956234141] [2023-03-31 00:43:38,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-31 00:43:38,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:38,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:43:38,061 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:43:38,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-03-31 00:43:38,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-31 00:43:38,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 00:43:38,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 13 conjunts are in the unsatisfiable core [2023-03-31 00:43:38,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:43:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:43:38,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:43:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-03-31 00:43:38,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:43:38,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001439448] [2023-03-31 00:43:38,315 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 00:43:38,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956234141] [2023-03-31 00:43:38,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956234141] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:43:38,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 00:43:38,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-03-31 00:43:38,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807244601] [2023-03-31 00:43:38,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 00:43:38,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-03-31 00:43:38,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:43:38,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-03-31 00:43:38,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-03-31 00:43:38,317 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2023-03-31 00:43:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:43:38,465 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2023-03-31 00:43:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-03-31 00:43:38,466 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 54 [2023-03-31 00:43:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:43:38,467 INFO L225 Difference]: With dead ends: 140 [2023-03-31 00:43:38,467 INFO L226 Difference]: Without dead ends: 132 [2023-03-31 00:43:38,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-03-31 00:43:38,468 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 153 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 00:43:38,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 175 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 00:43:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-03-31 00:43:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2023-03-31 00:43:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 104 states have internal predecessors, (135), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-03-31 00:43:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2023-03-31 00:43:38,487 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 54 [2023-03-31 00:43:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:43:38,487 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2023-03-31 00:43:38,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2023-03-31 00:43:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2023-03-31 00:43:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-03-31 00:43:38,488 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:43:38,488 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:43:38,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-03-31 00:43:38,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-03-31 00:43:38,694 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:43:38,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:43:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1397474810, now seen corresponding path program 3 times [2023-03-31 00:43:38,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:43:38,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769936131] [2023-03-31 00:43:38,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:38,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:43:38,707 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 00:43:38,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005926655] [2023-03-31 00:43:38,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-31 00:43:38,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:38,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:43:38,708 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:43:38,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-03-31 00:43:38,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-03-31 00:43:38,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 00:43:38,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 25 conjunts are in the unsatisfiable core [2023-03-31 00:43:38,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:43:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:43:39,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:43:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-03-31 00:43:39,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:43:39,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769936131] [2023-03-31 00:43:39,402 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-31 00:43:39,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005926655] [2023-03-31 00:43:39,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005926655] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:43:39,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-31 00:43:39,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2023-03-31 00:43:39,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161872162] [2023-03-31 00:43:39,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-31 00:43:39,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-03-31 00:43:39,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:43:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-03-31 00:43:39,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-03-31 00:43:39,405 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2023-03-31 00:43:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:43:39,772 INFO L93 Difference]: Finished difference Result 250 states and 321 transitions. [2023-03-31 00:43:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-03-31 00:43:39,773 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) Word has length 108 [2023-03-31 00:43:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:43:39,775 INFO L225 Difference]: With dead ends: 250 [2023-03-31 00:43:39,775 INFO L226 Difference]: Without dead ends: 242 [2023-03-31 00:43:39,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 190 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2023-03-31 00:43:39,777 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 314 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:43:39,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 282 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:43:39,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-03-31 00:43:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2023-03-31 00:43:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 193 states have (on average 1.3212435233160622) internal successors, (255), 194 states have internal predecessors, (255), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-03-31 00:43:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 303 transitions. [2023-03-31 00:43:39,807 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 303 transitions. Word has length 108 [2023-03-31 00:43:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:43:39,807 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 303 transitions. [2023-03-31 00:43:39,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 20 states have call predecessors, (24), 21 states have call successors, (24) [2023-03-31 00:43:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 303 transitions. [2023-03-31 00:43:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-03-31 00:43:39,809 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:43:39,809 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:43:39,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-03-31 00:43:40,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-03-31 00:43:40,015 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 00:43:40,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:43:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1773411066, now seen corresponding path program 4 times [2023-03-31 00:43:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:43:40,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163696131] [2023-03-31 00:43:40,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:43:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:43:40,032 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-31 00:43:40,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768537701] [2023-03-31 00:43:40,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-31 00:43:40,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:43:40,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:43:40,034 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 00:43:40,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-03-31 00:43:40,239 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-31 00:43:40,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-03-31 00:43:40,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-03-31 00:43:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-31 00:43:40,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-03-31 00:43:40,412 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-03-31 00:43:40,413 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-03-31 00:43:40,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-03-31 00:43:40,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-03-31 00:43:40,624 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:43:40,627 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-03-31 00:43:40,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.03 12:43:40 BoogieIcfgContainer [2023-03-31 00:43:40,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-03-31 00:43:40,696 INFO L158 Benchmark]: Toolchain (without parser) took 11335.42ms. Allocated memory was 255.9MB in the beginning and 307.2MB in the end (delta: 51.4MB). Free memory was 201.4MB in the beginning and 150.9MB in the end (delta: 50.5MB). Peak memory consumption was 102.6MB. Max. memory is 8.0GB. [2023-03-31 00:43:40,696 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-03-31 00:43:40,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.71ms. Allocated memory is still 255.9MB. Free memory was 201.4MB in the beginning and 190.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-03-31 00:43:40,697 INFO L158 Benchmark]: Boogie Preprocessor took 24.70ms. Allocated memory is still 255.9MB. Free memory was 190.6MB in the beginning and 189.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-03-31 00:43:40,697 INFO L158 Benchmark]: RCFGBuilder took 396.77ms. Allocated memory is still 255.9MB. Free memory was 189.2MB in the beginning and 176.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-03-31 00:43:40,697 INFO L158 Benchmark]: TraceAbstraction took 10645.30ms. Allocated memory was 255.9MB in the beginning and 307.2MB in the end (delta: 51.4MB). Free memory was 175.9MB in the beginning and 150.9MB in the end (delta: 25.0MB). Peak memory consumption was 77.4MB. Max. memory is 8.0GB. [2023-03-31 00:43:40,698 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.14ms. Allocated memory is still 181.4MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.71ms. Allocated memory is still 255.9MB. Free memory was 201.4MB in the beginning and 190.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.70ms. Allocated memory is still 255.9MB. Free memory was 190.6MB in the beginning and 189.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 396.77ms. Allocated memory is still 255.9MB. Free memory was 189.2MB in the beginning and 176.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10645.30ms. Allocated memory was 255.9MB in the beginning and 307.2MB in the end (delta: 51.4MB). Free memory was 175.9MB in the beginning and 150.9MB in the end (delta: 25.0MB). Peak memory consumption was 77.4MB. 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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [\old(counter)=22, counter=0] [L21] int x, y; [L22] long long a, b, p, q; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L26] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=1048576, y=1048576] [L28] a = x [L29] b = y [L30] p = 1 [L31] q = 0 VAL [\old(counter)=0, a=1048576, b=1048576, counter=0, p=1, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=1048576, b=1048576, counter++=0, counter=1, p=1, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=1048576, b=1048576, counter=1, p=1, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=1048576, b=1048576, counter=1, p=1, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=524288, b=524288, counter=1, p=4, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=524288, b=524288, counter++=1, counter=2, p=4, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=524288, b=524288, counter=2, p=4, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=524288, b=524288, counter=2, p=4, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=262144, b=262144, counter=2, p=16, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=262144, b=262144, counter++=2, counter=3, p=16, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=262144, b=262144, counter=3, p=16, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=262144, b=262144, counter=3, p=16, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=131072, b=131072, counter=3, p=64, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=131072, b=131072, counter++=3, counter=4, p=64, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=131072, b=131072, counter=4, p=64, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=131072, b=131072, counter=4, p=64, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=65536, b=65536, counter=4, p=256, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=65536, b=65536, counter++=4, counter=5, p=256, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=65536, b=65536, counter=5, p=256, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=65536, b=65536, counter=5, p=256, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=32768, b=32768, counter=5, p=1024, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=32768, b=32768, counter++=5, counter=6, p=1024, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=32768, b=32768, counter=6, p=1024, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=32768, b=32768, counter=6, p=1024, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=16384, b=16384, counter=6, p=4096, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=16384, b=16384, counter++=6, counter=7, p=4096, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=16384, b=16384, counter=7, p=4096, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=16384, b=16384, counter=7, p=4096, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=8192, b=8192, counter=7, p=16384, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=8192, b=8192, counter++=7, counter=8, p=16384, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=8192, b=8192, counter=8, p=16384, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=8192, b=8192, counter=8, p=16384, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=4096, b=4096, counter=8, p=65536, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=4096, b=4096, counter++=8, counter=9, p=65536, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=4096, b=4096, counter=9, p=65536, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=4096, b=4096, counter=9, p=65536, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=2048, b=2048, counter=9, p=262144, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=2048, b=2048, counter++=9, counter=10, p=262144, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=2048, b=2048, counter=10, p=262144, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=2048, b=2048, counter=10, p=262144, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=1024, b=1024, counter=10, p=1048576, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=1024, b=1024, counter++=10, counter=11, p=1048576, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=1024, b=1024, counter=11, p=1048576, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=1024, b=1024, counter=11, p=1048576, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=512, b=512, counter=11, p=4194304, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=512, b=512, counter++=11, counter=12, p=4194304, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=512, b=512, counter=12, p=4194304, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=512, b=512, counter=12, p=4194304, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=256, b=256, counter=12, p=16777216, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=256, b=256, counter++=12, counter=13, p=16777216, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=256, b=256, counter=13, p=16777216, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=256, b=256, counter=13, p=16777216, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=128, b=128, counter=13, p=67108864, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=128, b=128, counter++=13, counter=14, p=67108864, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=128, b=128, counter=14, p=67108864, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=128, b=128, counter=14, p=67108864, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=64, b=64, counter=14, p=268435456, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=64, b=64, counter++=14, counter=15, p=268435456, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=64, b=64, counter=15, p=268435456, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=64, b=64, counter=15, p=268435456, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=32, b=32, counter=15, p=1073741824, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=32, b=32, counter++=15, counter=16, p=1073741824, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=32, b=32, counter=16, p=1073741824, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=32, b=32, counter=16, p=1073741824, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=16, b=16, counter=16, p=4294967296, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=16, b=16, counter++=16, counter=17, p=4294967296, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=16, b=16, counter=17, p=4294967296, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=16, b=16, counter=17, p=4294967296, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=8, b=8, counter=17, p=17179869184, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=8, b=8, counter++=17, counter=18, p=17179869184, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=8, b=8, counter=18, p=17179869184, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=8, b=8, counter=18, p=17179869184, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=4, b=4, counter=18, p=68719476736, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=4, b=4, counter++=18, counter=19, p=68719476736, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=4, b=4, counter=19, p=68719476736, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=4, b=4, counter=19, p=68719476736, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=2, b=2, counter=19, p=274877906944, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, b=2, counter++=19, counter=20, p=274877906944, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(counter)=0, a=2, b=2, counter=20, p=274877906944, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [\old(counter)=0, a=2, b=2, counter=20, p=274877906944, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [\old(counter)=0, a=1, b=1, counter=20, p=1099511627776, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [\old(counter)=0, a=1, b=1, counter++=20, counter=21, p=1099511627776, q=0, x=1048576, y=1048576] [L33] COND FALSE !(counter++<20) [L56] CALL __VERIFIER_assert(q == (long long) x * y) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 12, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 683 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 673 mSDsluCounter, 1454 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1125 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 835 IncrementalHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 329 mSDtfsCounter, 835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 728 GetRequests, 588 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=11, InterpolantAutomatonStates: 128, 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, 11 MinimizatonAttempts, 103 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 626 NumberOfCodeBlocks, 626 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 674 ConstructedInterpolants, 1 QuantifiedInterpolants, 2098 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1480 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 352/1140 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 proved your program to be incorrect! [2023-03-31 00:43:40,712 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...