/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:07:19,095 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:07:19,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:07:19,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:07:19,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:07:19,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:07:19,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:07:19,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:07:19,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:07:19,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:07:19,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:07:19,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:07:19,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:07:19,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:07:19,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:07:19,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:07:19,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:07:19,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:07:19,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:07:19,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:07:19,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:07:19,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:07:19,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:07:19,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:07:19,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:07:19,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:07:19,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:07:19,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:07:19,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:07:19,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:07:19,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:07:19,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:07:19,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:07:19,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:07:19,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:07:19,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:07:19,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:07:19,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:07:19,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:07:19,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:07:19,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:07:19,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 03:07:19,194 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:07:19,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:07:19,195 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:07:19,195 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:07:19,195 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:07:19,195 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:07:19,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:07:19,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:07:19,196 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:07:19,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:07:19,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:07:19,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:07:19,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:07:19,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:07:19,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:07:19,197 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:07:19,197 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:07:19,197 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:07:19,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:07:19,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:07:19,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:07:19,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:07:19,197 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:07:19,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:07:19,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:07:19,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:07:19,198 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:07:19,198 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:07:19,198 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:07:19,198 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:07:19,198 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:07:19,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:07:19,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:07:19,199 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 03:07:19,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:07:19,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:07:19,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:07:19,423 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:07:19,424 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:07:19,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c [2022-01-10 03:07:19,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e714da57b/949c42b85ad044f18033a31621278e70/FLAG866756407 [2022-01-10 03:07:19,806 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:07:19,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c [2022-01-10 03:07:19,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e714da57b/949c42b85ad044f18033a31621278e70/FLAG866756407 [2022-01-10 03:07:19,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e714da57b/949c42b85ad044f18033a31621278e70 [2022-01-10 03:07:19,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:07:19,834 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:07:19,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:07:19,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:07:19,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:07:19,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:07:19" (1/1) ... [2022-01-10 03:07:19,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2009df5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:07:19, skipping insertion in model container [2022-01-10 03:07:19,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:07:19" (1/1) ... [2022-01-10 03:07:19,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:07:19,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:07:19,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c[489,502] [2022-01-10 03:07:20,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:07:20,033 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:07:20,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c[489,502] [2022-01-10 03:07:20,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:07:20,073 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:07:20,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:07:20 WrapperNode [2022-01-10 03:07:20,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:07:20,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:07:20,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:07:20,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:07:20,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:07:20" (1/1) ... [2022-01-10 03:07:20,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:07:20" (1/1) ... [2022-01-10 03:07:20,109 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-01-10 03:07:20,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:07:20,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:07:20,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:07:20,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:07:20,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:07:20" (1/1) ... [2022-01-10 03:07:20,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:07:20" (1/1) ... [2022-01-10 03:07:20,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:07:20" (1/1) ... [2022-01-10 03:07:20,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:07:20" (1/1) ... [2022-01-10 03:07:20,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:07:20" (1/1) ... [2022-01-10 03:07:20,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:07:20" (1/1) ... [2022-01-10 03:07:20,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:07:20" (1/1) ... [2022-01-10 03:07:20,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:07:20,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:07:20,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:07:20,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:07:20,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:07:20" (1/1) ... [2022-01-10 03:07:20,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:07:20,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:07:20,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 03:07:20,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 03:07:20,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:07:20,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:07:20,186 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-10 03:07:20,186 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-10 03:07:20,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:07:20,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:07:20,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:07:20,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:07:20,245 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:07:20,246 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:07:20,431 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:07:20,452 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:07:20,452 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 03:07:20,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:07:20 BoogieIcfgContainer [2022-01-10 03:07:20,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:07:20,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:07:20,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:07:20,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:07:20,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:07:19" (1/3) ... [2022-01-10 03:07:20,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f35af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:07:20, skipping insertion in model container [2022-01-10 03:07:20,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:07:20" (2/3) ... [2022-01-10 03:07:20,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f35af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:07:20, skipping insertion in model container [2022-01-10 03:07:20,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:07:20" (3/3) ... [2022-01-10 03:07:20,460 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound1.c [2022-01-10 03:07:20,464 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:07:20,464 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:07:20,504 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:07:20,510 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 03:07:20,510 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:07:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-10 03:07:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 03:07:20,538 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:07:20,539 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:20,540 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:07:20,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:07:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash 516392259, now seen corresponding path program 1 times [2022-01-10 03:07:20,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:07:20,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619201527] [2022-01-10 03:07:20,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:07:20,553 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:07:20,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:07:20,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:07:20,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 03:07:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:07:20,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:07:20,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:07:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:07:20,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:07:20,694 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:20,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619201527] [2022-01-10 03:07:20,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619201527] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:07:20,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:07:20,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:07:20,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594471086] [2022-01-10 03:07:20,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:07:20,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:07:20,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:20,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:07:20,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:07:20,717 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 03:07:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:07:20,738 INFO L93 Difference]: Finished difference Result 61 states and 99 transitions. [2022-01-10 03:07:20,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:07:20,740 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-01-10 03:07:20,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:07:20,745 INFO L225 Difference]: With dead ends: 61 [2022-01-10 03:07:20,745 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 03:07:20,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:07:20,756 INFO L933 BasicCegarLoop]: 42 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, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:07:20,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:07:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 03:07:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 03:07:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:07:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-01-10 03:07:20,789 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 29 [2022-01-10 03:07:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:07:20,791 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-01-10 03:07:20,791 INFO L471 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 03:07:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-01-10 03:07:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 03:07:20,792 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:07:20,793 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:20,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 03:07:20,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:21,000 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:07:21,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:07:21,000 INFO L85 PathProgramCache]: Analyzing trace with hash 501437177, now seen corresponding path program 1 times [2022-01-10 03:07:21,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:07:21,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400978744] [2022-01-10 03:07:21,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:07:21,001 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:07:21,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:07:21,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:07:21,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 03:07:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:07:21,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 03:07:21,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:07:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:07:21,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:07:21,253 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:21,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400978744] [2022-01-10 03:07:21,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400978744] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:07:21,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:07:21,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:07:21,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704167862] [2022-01-10 03:07:21,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:07:21,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:07:21,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:21,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:07:21,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:07:21,256 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 03:07:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:07:22,139 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2022-01-10 03:07:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:07:22,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-01-10 03:07:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:07:22,159 INFO L225 Difference]: With dead ends: 44 [2022-01-10 03:07:22,159 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 03:07:22,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:07:22,160 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 03:07:22,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 139 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 03:07:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 03:07:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-01-10 03:07:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 03:07:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2022-01-10 03:07:22,168 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 29 [2022-01-10 03:07:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:07:22,169 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2022-01-10 03:07:22,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 03:07:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2022-01-10 03:07:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 03:07:22,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:07:22,170 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:22,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-01-10 03:07:22,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:22,376 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:07:22,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:07:22,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1017640517, now seen corresponding path program 1 times [2022-01-10 03:07:22,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:07:22,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062991929] [2022-01-10 03:07:22,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:07:22,377 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:07:22,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:07:22,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:07:22,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 03:07:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:07:22,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 03:07:22,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:07:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 03:07:22,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:07:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:07:26,494 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:26,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062991929] [2022-01-10 03:07:26,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062991929] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:07:26,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:07:26,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-01-10 03:07:26,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542556136] [2022-01-10 03:07:26,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:07:26,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:07:26,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:26,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:07:26,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:07:26,496 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:07:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:07:31,447 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2022-01-10 03:07:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:07:31,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-01-10 03:07:31,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:07:31,481 INFO L225 Difference]: With dead ends: 66 [2022-01-10 03:07:31,481 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 03:07:31,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-10 03:07:31,482 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-10 03:07:31,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 138 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-01-10 03:07:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 03:07:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-01-10 03:07:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-01-10 03:07:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2022-01-10 03:07:31,495 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 34 [2022-01-10 03:07:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:07:31,495 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2022-01-10 03:07:31,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:07:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2022-01-10 03:07:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 03:07:31,497 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:07:31,497 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:31,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 03:07:31,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:31,698 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:07:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:07:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1133401081, now seen corresponding path program 1 times [2022-01-10 03:07:31,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:07:31,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677397085] [2022-01-10 03:07:31,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:07:31,699 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:07:31,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:07:31,700 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:07:31,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 03:07:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:07:31,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 03:07:31,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:07:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 03:07:32,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:07:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-01-10 03:07:36,965 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:36,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677397085] [2022-01-10 03:07:36,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677397085] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:07:36,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:07:36,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-01-10 03:07:36,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425862345] [2022-01-10 03:07:36,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:07:36,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:07:36,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:36,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:07:36,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:07:36,969 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-10 03:07:43,990 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:07:44,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:07:44,492 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2022-01-10 03:07:44,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:07:44,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-01-10 03:07:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:07:44,509 INFO L225 Difference]: With dead ends: 64 [2022-01-10 03:07:44,509 INFO L226 Difference]: Without dead ends: 62 [2022-01-10 03:07:44,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-10 03:07:44,510 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-01-10 03:07:44,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2022-01-10 03:07:44,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-10 03:07:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-01-10 03:07:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 32 states have (on average 1.28125) internal successors, (41), 34 states have internal predecessors, (41), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-01-10 03:07:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2022-01-10 03:07:44,521 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 39 [2022-01-10 03:07:44,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:07:44,522 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2022-01-10 03:07:44,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-10 03:07:44,522 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2022-01-10 03:07:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 03:07:44,523 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:07:44,523 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:44,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-01-10 03:07:44,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:44,727 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:07:44,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:07:44,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1954831506, now seen corresponding path program 1 times [2022-01-10 03:07:44,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:07:44,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608305688] [2022-01-10 03:07:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:07:44,728 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:07:44,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:07:44,729 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:07:44,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 03:07:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:07:44,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-10 03:07:44,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:07:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-10 03:07:45,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:07:45,770 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:45,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608305688] [2022-01-10 03:07:45,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608305688] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:07:45,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:07:45,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-10 03:07:45,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824614043] [2022-01-10 03:07:45,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:07:45,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 03:07:45,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:45,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 03:07:45,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:07:45,772 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 03:07:46,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:07:46,985 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2022-01-10 03:07:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 03:07:47,000 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 45 [2022-01-10 03:07:47,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:07:47,001 INFO L225 Difference]: With dead ends: 68 [2022-01-10 03:07:47,001 INFO L226 Difference]: Without dead ends: 66 [2022-01-10 03:07:47,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-01-10 03:07:47,003 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:07:47,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 235 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 17 Unchecked, 1.1s Time] [2022-01-10 03:07:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-10 03:07:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-01-10 03:07:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 38 states have internal predecessors, (44), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-01-10 03:07:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2022-01-10 03:07:47,011 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 45 [2022-01-10 03:07:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:07:47,012 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2022-01-10 03:07:47,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 03:07:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2022-01-10 03:07:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 03:07:47,013 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:07:47,013 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:47,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-01-10 03:07:47,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:47,219 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:07:47,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:07:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1265228631, now seen corresponding path program 1 times [2022-01-10 03:07:47,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:07:47,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480209175] [2022-01-10 03:07:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:07:47,220 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:07:47,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:07:47,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:07:47,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 03:07:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:07:47,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 03:07:47,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:07:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-10 03:07:48,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:07:48,149 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:48,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480209175] [2022-01-10 03:07:48,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480209175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:07:48,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:07:48,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 03:07:48,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814351219] [2022-01-10 03:07:48,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:07:48,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 03:07:48,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:48,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 03:07:48,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:07:48,151 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 03:07:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:07:48,286 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2022-01-10 03:07:48,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 03:07:48,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-01-10 03:07:48,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:07:48,287 INFO L225 Difference]: With dead ends: 87 [2022-01-10 03:07:48,287 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 03:07:48,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:07:48,288 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:07:48,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 119 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-01-10 03:07:48,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 03:07:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-01-10 03:07:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:07:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-01-10 03:07:48,293 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 47 [2022-01-10 03:07:48,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:07:48,293 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-01-10 03:07:48,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 03:07:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-01-10 03:07:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-10 03:07:48,294 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:07:48,294 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:48,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 03:07:48,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:48,494 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:07:48,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:07:48,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1617953190, now seen corresponding path program 1 times [2022-01-10 03:07:48,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:07:48,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193560166] [2022-01-10 03:07:48,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:07:48,495 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:07:48,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:07:48,496 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:07:48,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 03:07:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:07:48,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 03:07:48,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:07:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-01-10 03:07:49,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:07:49,498 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:49,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193560166] [2022-01-10 03:07:49,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193560166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:07:49,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:07:49,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-10 03:07:49,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258068336] [2022-01-10 03:07:49,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:07:49,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 03:07:49,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:49,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 03:07:49,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:07:49,499 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-01-10 03:07:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:07:50,225 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-01-10 03:07:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 03:07:50,226 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 50 [2022-01-10 03:07:50,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:07:50,226 INFO L225 Difference]: With dead ends: 49 [2022-01-10 03:07:50,226 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 03:07:50,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:07:50,227 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 03:07:50,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 175 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 03:07:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 03:07:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-01-10 03:07:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.0) internal successors, (27), 27 states have internal predecessors, (27), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:07:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-01-10 03:07:50,232 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 50 [2022-01-10 03:07:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:07:50,232 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-01-10 03:07:50,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-01-10 03:07:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-01-10 03:07:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 03:07:50,233 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:07:50,233 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:50,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-01-10 03:07:50,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:50,447 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:07:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:07:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash 470396518, now seen corresponding path program 1 times [2022-01-10 03:07:50,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:07:50,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414715075] [2022-01-10 03:07:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:07:50,448 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:07:50,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:07:50,450 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:07:50,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 03:07:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:07:50,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 03:07:50,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:07:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-10 03:07:51,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:07:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-10 03:07:57,205 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:57,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414715075] [2022-01-10 03:07:57,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414715075] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:07:57,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:07:57,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-01-10 03:07:57,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51036729] [2022-01-10 03:07:57,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:07:57,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:07:57,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:07:57,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:07:57,207 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 03:08:00,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:08:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:08:02,104 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-01-10 03:08:02,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:08:02,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2022-01-10 03:08:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:08:02,105 INFO L225 Difference]: With dead ends: 45 [2022-01-10 03:08:02,105 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 03:08:02,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-10 03:08:02,106 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-10 03:08:02,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-01-10 03:08:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 03:08:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 03:08:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:08:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 03:08:02,107 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2022-01-10 03:08:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:08:02,107 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 03:08:02,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 03:08:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 03:08:02,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 03:08:02,109 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 03:08:02,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 03:08:02,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:08:02,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 03:08:13,595 INFO L854 garLoopResultBuilder]: At program point L35-2(lines 35 52) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (and (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)))) (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~y~0#1| (_ BitVec 32))) (and (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~b~0#1| .cse0) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (bvmul |ULTIMATE.start_main_~s~0#1| .cse0) (bvneg |ULTIMATE.start_main_~b~0#1|))))) [2022-01-10 03:08:13,595 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 03:08:13,595 INFO L861 garLoopResultBuilder]: At program point L58(lines 18 59) the Hoare annotation is: true [2022-01-10 03:08:13,596 INFO L854 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32))) [2022-01-10 03:08:13,596 INFO L854 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~b~0#1| .cse0) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (bvmul |ULTIMATE.start_main_~s~0#1| .cse0) (bvneg |ULTIMATE.start_main_~b~0#1|))))) [2022-01-10 03:08:13,596 INFO L854 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~b~0#1| .cse0) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (bvmul |ULTIMATE.start_main_~s~0#1| .cse0) (bvneg |ULTIMATE.start_main_~b~0#1|))))) [2022-01-10 03:08:13,596 INFO L858 garLoopResultBuilder]: For program point L38(lines 35 52) no Hoare annotation was computed. [2022-01-10 03:08:13,596 INFO L854 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (and (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)))) (= |ULTIMATE.start_main_~a~0#1| (bvadd (bvmul |ULTIMATE.start_main_~r~0#1| .cse0) (bvmul |ULTIMATE.start_main_~p~0#1| .cse1))) (exists ((|ULTIMATE.start_main_~y~0#1| (_ BitVec 32))) (and (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~b~0#1| .cse0) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~q~0#1| .cse1) (bvmul |ULTIMATE.start_main_~s~0#1| .cse0) (bvneg |ULTIMATE.start_main_~b~0#1|))))) [2022-01-10 03:08:13,596 INFO L854 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (and (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)))) (= |ULTIMATE.start_main_~a~0#1| (bvadd (bvmul |ULTIMATE.start_main_~r~0#1| .cse0) (bvmul |ULTIMATE.start_main_~p~0#1| .cse1))) (exists ((|ULTIMATE.start_main_~y~0#1| (_ BitVec 32))) (and (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~b~0#1| .cse0) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~q~0#1| .cse1) (bvmul |ULTIMATE.start_main_~s~0#1| .cse0) (bvneg |ULTIMATE.start_main_~b~0#1|))))) [2022-01-10 03:08:13,596 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 03:08:13,596 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 03:08:13,596 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 03:08:13,596 INFO L858 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-01-10 03:08:13,596 INFO L858 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-01-10 03:08:13,596 INFO L854 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32))) [2022-01-10 03:08:13,597 INFO L854 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32))) [2022-01-10 03:08:13,597 INFO L854 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~b~0#1| .cse0) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (bvmul |ULTIMATE.start_main_~s~0#1| .cse0) (bvneg |ULTIMATE.start_main_~b~0#1|))))) [2022-01-10 03:08:13,597 INFO L861 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-01-10 03:08:13,597 INFO L858 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-01-10 03:08:13,597 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2022-01-10 03:08:13,597 INFO L854 garLoopResultBuilder]: At program point L43-2(lines 35 52) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (and (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)))) (= |ULTIMATE.start_main_~a~0#1| (bvadd (bvmul |ULTIMATE.start_main_~r~0#1| .cse0) (bvmul |ULTIMATE.start_main_~p~0#1| .cse1))) (exists ((|ULTIMATE.start_main_~y~0#1| (_ BitVec 32))) (and (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~b~0#1| .cse0) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~q~0#1| .cse1) (bvmul |ULTIMATE.start_main_~s~0#1| .cse0) (bvneg |ULTIMATE.start_main_~b~0#1|))))) [2022-01-10 03:08:13,597 INFO L854 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse1 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 32))) (and (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)))) (= |ULTIMATE.start_main_~a~0#1| (bvadd (bvmul |ULTIMATE.start_main_~r~0#1| .cse0) (bvmul |ULTIMATE.start_main_~p~0#1| .cse1))) (exists ((|ULTIMATE.start_main_~y~0#1| (_ BitVec 32))) (and (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~b~0#1| .cse0) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~q~0#1| .cse1) (bvmul |ULTIMATE.start_main_~s~0#1| .cse0) (bvneg |ULTIMATE.start_main_~b~0#1|))))) [2022-01-10 03:08:13,597 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-01-10 03:08:13,597 INFO L858 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-01-10 03:08:13,597 INFO L858 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-01-10 03:08:13,597 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-01-10 03:08:13,597 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 16) the Hoare annotation is: true [2022-01-10 03:08:13,597 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-01-10 03:08:13,597 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2022-01-10 03:08:13,598 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2022-01-10 03:08:13,598 INFO L858 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2022-01-10 03:08:13,598 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-01-10 03:08:13,600 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:08:13,601 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 03:08:13,605 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:08:13,605 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:08:13,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:08:13,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] [2022-01-10 03:08:13,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] [2022-01-10 03:08:13,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] [2022-01-10 03:08:13,611 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:08:13,611 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:08:13,611 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:08:13,612 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] [2022-01-10 03:08:13,612 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] [2022-01-10 03:08:13,612 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] [2022-01-10 03:08:13,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:08:13 BoogieIcfgContainer [2022-01-10 03:08:13,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 03:08:13,613 INFO L158 Benchmark]: Toolchain (without parser) took 53778.99ms. Allocated memory was 194.0MB in the beginning and 274.7MB in the end (delta: 80.7MB). Free memory was 143.8MB in the beginning and 138.1MB in the end (delta: 5.7MB). Peak memory consumption was 87.0MB. Max. memory is 8.0GB. [2022-01-10 03:08:13,614 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 160.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 03:08:13,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.09ms. Allocated memory is still 194.0MB. Free memory was 143.6MB in the beginning and 169.5MB in the end (delta: -25.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 03:08:13,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.26ms. Allocated memory is still 194.0MB. Free memory was 169.0MB in the beginning and 167.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:08:13,614 INFO L158 Benchmark]: Boogie Preprocessor took 18.02ms. Allocated memory is still 194.0MB. Free memory was 167.4MB in the beginning and 166.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:08:13,615 INFO L158 Benchmark]: RCFGBuilder took 326.24ms. Allocated memory is still 194.0MB. Free memory was 166.4MB in the beginning and 155.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 03:08:13,615 INFO L158 Benchmark]: TraceAbstraction took 53156.97ms. Allocated memory was 194.0MB in the beginning and 274.7MB in the end (delta: 80.7MB). Free memory was 155.8MB in the beginning and 138.1MB in the end (delta: 17.7MB). Peak memory consumption was 99.1MB. Max. memory is 8.0GB. [2022-01-10 03:08:13,617 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.09ms. Allocated memory is still 194.0MB. Free memory is still 160.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.09ms. Allocated memory is still 194.0MB. Free memory was 143.6MB in the beginning and 169.5MB in the end (delta: -25.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.26ms. Allocated memory is still 194.0MB. Free memory was 169.0MB in the beginning and 167.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.02ms. Allocated memory is still 194.0MB. Free memory was 167.4MB in the beginning and 166.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 326.24ms. Allocated memory is still 194.0MB. Free memory was 166.4MB in the beginning and 155.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 53156.97ms. Allocated memory was 194.0MB in the beginning and 274.7MB in the end (delta: 80.7MB). Free memory was 155.8MB in the beginning and 138.1MB in the end (delta: 17.7MB). Peak memory consumption was 99.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] * 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 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.1s, OverallIterations: 8, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 19.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 1093 SdHoareTripleChecker+Invalid, 18.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 25 IncrementalHoareTripleChecker+Unchecked, 811 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 294 IncrementalHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 282 mSDtfsCounter, 294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 466 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=5, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 50 PreInvPairs, 62 NumberOfFragments, 456 HoareAnnotationTreeSize, 50 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 230 FormulaSimplificationTreeSizeReductionInter, 11.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 455 ConstructedInterpolants, 11 QuantifiedInterpolants, 1919 SizeOfPredicates, 33 NumberOfNonLiveVariables, 598 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 477/498 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant [2022-01-10 03:08:13,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:08:13,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:08:13,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:08:13,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] [2022-01-10 03:08:13,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] [2022-01-10 03:08:13,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] [2022-01-10 03:08:13,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:08:13,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:08:13,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-01-10 03:08:13,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] [2022-01-10 03:08:13,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] [2022-01-10 03:08:13,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1,QUANTIFIED] Derived loop invariant: (((((((\exists ULTIMATE.start_main_~x~0#1 : bv32 :: (~bvsle32(ULTIMATE.start_main_~x~0#1, 1bv32) && ~bvsge32(ULTIMATE.start_main_~x~0#1, 1bv32)) && a == ~sign_extendFrom8To32(ULTIMATE.start_main_~x~0#1)) && a == ~bvadd32(~bvmul64(r, ~sign_extendFrom8To32(y)), ~bvmul64(p, ~sign_extendFrom8To32(x)))) && (\exists ULTIMATE.start_main_~y~0#1 : bv32 :: (~bvsle32(ULTIMATE.start_main_~y~0#1, 1bv32) && b == ~sign_extendFrom8To32(ULTIMATE.start_main_~y~0#1)) && ~bvsge32(ULTIMATE.start_main_~y~0#1, 1bv32))) && 0bv64 == r) && b == ~sign_extendFrom8To32(y)) && q == 0bv64) && p == 1bv64) && 0bv64 == ~bvadd32(~bvmul64(q, ~sign_extendFrom8To32(x)), ~bvmul64(s, ~sign_extendFrom8To32(y)), ~bvneg64(b)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 03:08:13,678 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...