/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/dijkstra-u_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:03:30,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:03:30,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:03:30,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:03:30,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:03:30,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:03:30,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:03:30,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:03:30,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:03:30,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:03:30,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:03:30,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:03:30,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:03:30,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:03:30,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:03:30,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:03:30,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:03:30,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:03:30,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:03:30,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:03:30,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:03:30,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:03:30,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:03:30,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:03:30,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:03:30,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:03:30,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:03:30,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:03:30,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:03:30,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:03:30,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:03:30,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:03:30,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:03:30,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:03:30,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:03:30,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:03:30,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:03:30,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:03:30,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:03:30,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:03:30,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:03:30,563 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:03:30,583 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:03:30,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:03:30,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:03:30,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:03:30,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:03:30,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:03:30,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:03:30,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:03:30,585 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:03:30,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:03:30,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:03:30,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:03:30,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:03:30,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:03:30,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:03:30,585 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:03:30,585 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:03:30,585 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:03:30,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:03:30,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:03:30,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:03:30,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:03:30,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:03:30,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:03:30,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:03:30,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:03:30,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:03:30,586 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:03:30,586 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:03:30,586 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:03:30,587 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:03:30,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:03:30,587 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:03:30,587 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:03:30,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:03:30,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:03:30,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:03:30,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:03:30,817 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:03:30,818 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound1.c [2022-01-10 03:03:30,877 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7170b4c87/ceba8a067bbe4230a69cf477414e98e1/FLAG58b8a06ad [2022-01-10 03:03:31,251 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:03:31,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound1.c [2022-01-10 03:03:31,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7170b4c87/ceba8a067bbe4230a69cf477414e98e1/FLAG58b8a06ad [2022-01-10 03:03:31,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7170b4c87/ceba8a067bbe4230a69cf477414e98e1 [2022-01-10 03:03:31,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:03:31,276 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:03:31,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:03:31,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:03:31,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:03:31,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:03:31" (1/1) ... [2022-01-10 03:03:31,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a5a1f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:31, skipping insertion in model container [2022-01-10 03:03:31,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:03:31" (1/1) ... [2022-01-10 03:03:31,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:03:31,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:03:31,411 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/dijkstra-u_unwindbound1.c[525,538] [2022-01-10 03:03:31,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:03:31,434 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:03:31,441 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/dijkstra-u_unwindbound1.c[525,538] [2022-01-10 03:03:31,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:03:31,465 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:03:31,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:31 WrapperNode [2022-01-10 03:03:31,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:03:31,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:03:31,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:03:31,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:03:31,472 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:03:31" (1/1) ... [2022-01-10 03:03:31,489 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:03:31" (1/1) ... [2022-01-10 03:03:31,513 INFO L137 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2022-01-10 03:03:31,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:03:31,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:03:31,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:03:31,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:03:31,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:31" (1/1) ... [2022-01-10 03:03:31,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:31" (1/1) ... [2022-01-10 03:03:31,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:31" (1/1) ... [2022-01-10 03:03:31,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:31" (1/1) ... [2022-01-10 03:03:31,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:31" (1/1) ... [2022-01-10 03:03:31,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:31" (1/1) ... [2022-01-10 03:03:31,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:31" (1/1) ... [2022-01-10 03:03:31,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:03:31,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:03:31,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:03:31,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:03:31,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:31" (1/1) ... [2022-01-10 03:03:31,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:03:31,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:03:31,589 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:03:31,605 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:03:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:03:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:03:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:03:31,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:03:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:03:31,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:03:31,682 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:03:31,684 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:03:31,892 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:03:31,896 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:03:31,897 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 03:03:31,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:03:31 BoogieIcfgContainer [2022-01-10 03:03:31,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:03:31,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:03:31,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:03:31,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:03:31,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:03:31" (1/3) ... [2022-01-10 03:03:31,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6148d9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:03:31, skipping insertion in model container [2022-01-10 03:03:31,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:31" (2/3) ... [2022-01-10 03:03:31,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6148d9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:03:31, skipping insertion in model container [2022-01-10 03:03:31,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:03:31" (3/3) ... [2022-01-10 03:03:31,923 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound1.c [2022-01-10 03:03:31,926 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:03:31,926 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:03:31,963 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:03:31,969 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:03:31,969 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:03:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-10 03:03:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 03:03:31,988 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:31,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:31,989 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:31,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:31,992 INFO L85 PathProgramCache]: Analyzing trace with hash -797370321, now seen corresponding path program 1 times [2022-01-10 03:03:32,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:32,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588116086] [2022-01-10 03:03:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:32,001 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:32,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:32,003 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:03:32,004 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:03:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:32,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:03:32,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:32,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:32,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:03:32,131 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:32,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588116086] [2022-01-10 03:03:32,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588116086] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:03:32,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:03:32,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:03:32,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530755587] [2022-01-10 03:03:32,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:03:32,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:03:32,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:32,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:03:32,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:03:32,155 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:32,169 INFO L93 Difference]: Finished difference Result 57 states and 97 transitions. [2022-01-10 03:03:32,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:03:32,170 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-01-10 03:03:32,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:32,175 INFO L225 Difference]: With dead ends: 57 [2022-01-10 03:03:32,175 INFO L226 Difference]: Without dead ends: 26 [2022-01-10 03:03:32,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:03:32,179 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:03:32,180 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:03:32,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-10 03:03:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-10 03:03:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 03:03:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-01-10 03:03:32,208 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 10 [2022-01-10 03:03:32,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:32,208 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2022-01-10 03:03:32,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-01-10 03:03:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 03:03:32,209 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:32,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:32,220 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:03:32,417 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:03:32,417 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:32,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:32,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1698606518, now seen corresponding path program 1 times [2022-01-10 03:03:32,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:32,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219092271] [2022-01-10 03:03:32,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:32,419 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:32,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:32,421 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:03:32,422 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:03:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:32,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:03:32,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:32,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:03:32,530 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:32,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219092271] [2022-01-10 03:03:32,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219092271] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:03:32,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:03:32,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:03:32,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038396891] [2022-01-10 03:03:32,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:03:32,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:03:32,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:32,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:03:32,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:03:32,539 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:32,570 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-01-10 03:03:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:03:32,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-10 03:03:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:32,572 INFO L225 Difference]: With dead ends: 47 [2022-01-10 03:03:32,572 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 03:03:32,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:03:32,574 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:32,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:03:32,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 03:03:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 03:03:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 03:03:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-01-10 03:03:32,579 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 12 [2022-01-10 03:03:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:32,579 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2022-01-10 03:03:32,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-01-10 03:03:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 03:03:32,580 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:32,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:32,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 03:03:32,787 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:03:32,788 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:32,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:32,788 INFO L85 PathProgramCache]: Analyzing trace with hash 776097594, now seen corresponding path program 1 times [2022-01-10 03:03:32,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:32,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284585408] [2022-01-10 03:03:32,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:32,789 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:32,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:32,790 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:03:32,791 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:03:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:32,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:03:32,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:32,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:03:32,942 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:32,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284585408] [2022-01-10 03:03:32,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284585408] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:03:32,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:03:32,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:03:32,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387433008] [2022-01-10 03:03:32,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:03:32,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:03:32,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:32,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:03:32,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:03:32,944 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:34,276 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2022-01-10 03:03:34,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:03:34,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 03:03:34,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:34,301 INFO L225 Difference]: With dead ends: 46 [2022-01-10 03:03:34,301 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 03:03:34,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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:03:34,302 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:34,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 137 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-10 03:03:34,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 03:03:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-01-10 03:03:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 03:03:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2022-01-10 03:03:34,311 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 13 [2022-01-10 03:03:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:34,311 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2022-01-10 03:03:34,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2022-01-10 03:03:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 03:03:34,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:34,312 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:34,325 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:03:34,522 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:03:34,522 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:34,523 INFO L85 PathProgramCache]: Analyzing trace with hash 777587144, now seen corresponding path program 1 times [2022-01-10 03:03:34,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:34,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981405414] [2022-01-10 03:03:34,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:34,524 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:34,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:34,525 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:03:34,526 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:03:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:34,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:03:34,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:34,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:03:34,682 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:34,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981405414] [2022-01-10 03:03:34,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981405414] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:03:34,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:03:34,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 03:03:34,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838644578] [2022-01-10 03:03:34,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:03:34,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:03:34,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:34,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:03:34,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:03:34,684 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:34,745 INFO L93 Difference]: Finished difference Result 79 states and 118 transitions. [2022-01-10 03:03:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:03:34,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 03:03:34,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:34,747 INFO L225 Difference]: With dead ends: 79 [2022-01-10 03:03:34,747 INFO L226 Difference]: Without dead ends: 47 [2022-01-10 03:03:34,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:03:34,748 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:34,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:03:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-10 03:03:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-01-10 03:03:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 28 states have internal predecessors, (35), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 03:03:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2022-01-10 03:03:34,762 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 13 [2022-01-10 03:03:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:34,762 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2022-01-10 03:03:34,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2022-01-10 03:03:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 03:03:34,763 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:34,763 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:34,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 03:03:34,970 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:03:34,970 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:34,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:34,971 INFO L85 PathProgramCache]: Analyzing trace with hash 85983309, now seen corresponding path program 1 times [2022-01-10 03:03:34,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:34,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192046416] [2022-01-10 03:03:34,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:34,972 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:34,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:34,973 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:03:34,973 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:03:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:34,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:03:34,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:35,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:03:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:35,338 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:35,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192046416] [2022-01-10 03:03:35,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192046416] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:03:35,338 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:03:35,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-01-10 03:03:35,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633380392] [2022-01-10 03:03:35,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:03:35,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:03:35,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:35,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:03:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:03:35,339 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:36,825 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2022-01-10 03:03:36,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 03:03:36,826 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 03:03:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:36,827 INFO L225 Difference]: With dead ends: 147 [2022-01-10 03:03:36,827 INFO L226 Difference]: Without dead ends: 107 [2022-01-10 03:03:36,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-01-10 03:03:36,828 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 72 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:36,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 250 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 03:03:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-10 03:03:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 68. [2022-01-10 03:03:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 47 states have internal predecessors, (62), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 03:03:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2022-01-10 03:03:36,842 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 15 [2022-01-10 03:03:36,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:36,842 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2022-01-10 03:03:36,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2022-01-10 03:03:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 03:03:36,843 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:36,843 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:36,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 03:03:37,057 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:03:37,057 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:37,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1294398873, now seen corresponding path program 1 times [2022-01-10 03:03:37,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:37,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595413072] [2022-01-10 03:03:37,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:37,058 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:37,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:37,059 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:03:37,061 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:03:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:37,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 03:03:37,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:37,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:03:37,537 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:37,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595413072] [2022-01-10 03:03:37,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595413072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:03:37,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:03:37,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 03:03:37,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200413377] [2022-01-10 03:03:37,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:03:37,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 03:03:37,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:37,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 03:03:37,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 03:03:37,538 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:03:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:39,831 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2022-01-10 03:03:39,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 03:03:39,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-10 03:03:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:39,843 INFO L225 Difference]: With dead ends: 76 [2022-01-10 03:03:39,843 INFO L226 Difference]: Without dead ends: 68 [2022-01-10 03:03:39,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:03:39,844 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 41 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:39,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 150 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-10 03:03:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-10 03:03:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-01-10 03:03:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 47 states have internal predecessors, (61), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 03:03:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2022-01-10 03:03:39,851 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 18 [2022-01-10 03:03:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:39,852 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2022-01-10 03:03:39,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:03:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2022-01-10 03:03:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 03:03:39,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:39,852 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:39,869 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:03:40,060 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:03:40,060 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:40,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:40,061 INFO L85 PathProgramCache]: Analyzing trace with hash -755998974, now seen corresponding path program 1 times [2022-01-10 03:03:40,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:40,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37064566] [2022-01-10 03:03:40,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:40,061 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:40,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:40,064 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:03:40,066 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:03:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:40,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:03:40,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 03:03:40,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:03:40,549 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:40,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37064566] [2022-01-10 03:03:40,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37064566] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:03:40,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:03:40,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 03:03:40,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551952455] [2022-01-10 03:03:40,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:03:40,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 03:03:40,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:40,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 03:03:40,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 03:03:40,550 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:03:42,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:03:45,216 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:03:47,395 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:03:49,501 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:03:51,934 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:03:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:53,813 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2022-01-10 03:03:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 03:03:53,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-10 03:03:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:53,814 INFO L225 Difference]: With dead ends: 87 [2022-01-10 03:03:53,815 INFO L226 Difference]: Without dead ends: 71 [2022-01-10 03:03:53,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:03:53,815 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 44 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:53,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 142 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 13.1s Time] [2022-01-10 03:03:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-10 03:03:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-01-10 03:03:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-01-10 03:03:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2022-01-10 03:03:53,822 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 20 [2022-01-10 03:03:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:53,822 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2022-01-10 03:03:53,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:03:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2022-01-10 03:03:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 03:03:53,823 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:53,823 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:53,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 03:03:54,039 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:03:54,040 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:54,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash -231054963, now seen corresponding path program 2 times [2022-01-10 03:03:54,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:54,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741306526] [2022-01-10 03:03:54,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:03:54,041 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:54,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:54,042 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:03:54,042 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:03:54,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:03:54,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:03:54,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:03:54,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 03:03:54,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:03:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 03:03:54,429 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:54,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741306526] [2022-01-10 03:03:54,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741306526] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:03:54,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:03:54,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-01-10 03:03:54,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085738952] [2022-01-10 03:03:54,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:03:54,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 03:03:54,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 03:03:54,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 03:03:54,430 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:54,496 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2022-01-10 03:03:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:03:54,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 03:03:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:54,497 INFO L225 Difference]: With dead ends: 70 [2022-01-10 03:03:54,497 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 03:03:54,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:03:54,498 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:54,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:03:54,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 03:03:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 03:03:54,499 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:03:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 03:03:54,499 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-01-10 03:03:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:54,499 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 03:03:54,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 03:03:54,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 03:03:54,501 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 03:03:54,510 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:03:54,710 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:03:54,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 03:03:55,288 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-01-10 03:03:55,288 INFO L861 garLoopResultBuilder]: At program point L60(lines 20 61) the Hoare annotation is: true [2022-01-10 03:03:55,288 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2022-01-10 03:03:55,289 INFO L858 garLoopResultBuilder]: For program point L52-2(lines 20 61) no Hoare annotation was computed. [2022-01-10 03:03:55,289 INFO L858 garLoopResultBuilder]: For program point L44(lines 38 56) no Hoare annotation was computed. [2022-01-10 03:03:55,289 INFO L854 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: false [2022-01-10 03:03:55,289 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 03:03:55,289 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 03:03:55,289 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 03:03:55,289 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (bvslt ((_ zero_extend 32) |ULTIMATE.start_main_~n~0#1|) (_ bv1073741823 64)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2022-01-10 03:03:55,289 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: false [2022-01-10 03:03:55,289 INFO L858 garLoopResultBuilder]: For program point L8(lines 8 10) no Hoare annotation was computed. [2022-01-10 03:03:55,290 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 03:03:55,290 INFO L854 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2022-01-10 03:03:55,290 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: false [2022-01-10 03:03:55,290 INFO L858 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-01-10 03:03:55,290 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 56) no Hoare annotation was computed. [2022-01-10 03:03:55,290 INFO L854 garLoopResultBuilder]: At program point L38-2(lines 38 56) the Hoare annotation is: (and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (bvslt ((_ zero_extend 32) |ULTIMATE.start_main_~n~0#1|) (_ bv1073741823 64)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2022-01-10 03:03:55,290 INFO L858 garLoopResultBuilder]: For program point L30-1(lines 30 35) no Hoare annotation was computed. [2022-01-10 03:03:55,290 INFO L854 garLoopResultBuilder]: At program point L30-3(lines 30 35) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse1 (bvslt ((_ zero_extend 32) |ULTIMATE.start_main_~n~0#1|) (_ bv1073741823 64))) (.cse2 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (.cse3 (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32))) (.cse4 (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32)))) (or (and (= ~counter~0 (_ bv1 32)) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= ~counter~0 (_ bv0 32)) .cse1 .cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse3 .cse4))) [2022-01-10 03:03:55,290 INFO L858 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-01-10 03:03:55,290 INFO L854 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: false [2022-01-10 03:03:55,291 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: false [2022-01-10 03:03:55,291 INFO L854 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: false [2022-01-10 03:03:55,291 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-01-10 03:03:55,291 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-01-10 03:03:55,291 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-01-10 03:03:55,291 INFO L858 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-01-10 03:03:55,291 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-01-10 03:03:55,291 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 03:03:55,294 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:55,295 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 03:03:55,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:03:55 BoogieIcfgContainer [2022-01-10 03:03:55,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 03:03:55,305 INFO L158 Benchmark]: Toolchain (without parser) took 24028.53ms. Allocated memory was 176.2MB in the beginning and 216.0MB in the end (delta: 39.8MB). Free memory was 131.6MB in the beginning and 142.0MB in the end (delta: -10.4MB). Peak memory consumption was 29.8MB. Max. memory is 8.0GB. [2022-01-10 03:03:55,305 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 03:03:55,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.90ms. Allocated memory is still 176.2MB. Free memory was 131.4MB in the beginning and 151.8MB in the end (delta: -20.5MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-01-10 03:03:55,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.39ms. Allocated memory is still 176.2MB. Free memory was 151.8MB in the beginning and 150.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 03:03:55,306 INFO L158 Benchmark]: Boogie Preprocessor took 26.82ms. Allocated memory is still 176.2MB. Free memory was 150.1MB in the beginning and 148.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:03:55,306 INFO L158 Benchmark]: RCFGBuilder took 356.24ms. Allocated memory is still 176.2MB. Free memory was 148.7MB in the beginning and 136.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 03:03:55,306 INFO L158 Benchmark]: TraceAbstraction took 23405.32ms. Allocated memory was 176.2MB in the beginning and 216.0MB in the end (delta: 39.8MB). Free memory was 135.4MB in the beginning and 142.0MB in the end (delta: -6.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-01-10 03:03:55,307 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.10ms. Allocated memory is still 176.2MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.90ms. Allocated memory is still 176.2MB. Free memory was 131.4MB in the beginning and 151.8MB in the end (delta: -20.5MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.39ms. Allocated memory is still 176.2MB. Free memory was 151.8MB in the beginning and 150.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.82ms. Allocated memory is still 176.2MB. Free memory was 150.1MB in the beginning and 148.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 356.24ms. Allocated memory is still 176.2MB. Free memory was 148.7MB in the beginning and 136.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 23405.32ms. Allocated memory was 176.2MB in the beginning and 216.0MB in the end (delta: 39.8MB). Free memory was 135.4MB in the beginning and 142.0MB in the end (delta: -6.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: 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 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 17.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 977 SdHoareTripleChecker+Invalid, 16.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 701 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 257 IncrementalHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 276 mSDtfsCounter, 257 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, InterpolantAutomatonStates: 49, 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, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 93 PreInvPairs, 103 NumberOfFragments, 93 HoareAnnotationTreeSize, 93 FomulaSimplifications, 48 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 452 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 579 SizeOfPredicates, 12 NumberOfNonLiveVariables, 320 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 82/90 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: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((counter == 1bv32 && r == n) && ~bvslt32(~zero_extendFrom32To64(n), 1073741823bv64)) && cond == 1bv32) && p == 0bv32) && h == 0bv32) || ((((((r == n && counter == 0bv32) && ~bvslt32(~zero_extendFrom32To64(n), 1073741823bv64)) && cond == 1bv32) && q == 1bv32) && p == 0bv32) && h == 0bv32) RESULT: Ultimate proved your program to be correct! [2022-01-10 03:03:55,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...