/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/cohendiv-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:02:09,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:02:09,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:02:09,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:02:09,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:02:09,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:02:09,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:02:09,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:02:09,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:02:09,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:02:09,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:02:09,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:02:09,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:02:09,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:02:09,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:02:09,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:02:09,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:02:09,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:02:09,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:02:09,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:02:09,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:02:09,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:02:09,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:02:09,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:02:09,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:02:09,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:02:09,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:02:09,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:02:09,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:02:09,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:02:09,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:02:09,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:02:09,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:02:09,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:02:09,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:02:09,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:02:09,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:02:09,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:02:09,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:02:09,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:02:09,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:02:09,610 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:02:09,640 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:02:09,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:02:09,641 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:02:09,641 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:02:09,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:02:09,642 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:02:09,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:02:09,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:02:09,642 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:02:09,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:02:09,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:02:09,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:02:09,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:02:09,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:02:09,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:02:09,643 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:02:09,643 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:02:09,643 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:02:09,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:02:09,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:02:09,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:02:09,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:02:09,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:02:09,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:02:09,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:02:09,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:02:09,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:02:09,644 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:02:09,644 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:02:09,644 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:02:09,644 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:02:09,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:02:09,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:02:09,645 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:02:09,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:02:09,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:02:09,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:02:09,853 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:02:09,855 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:02:09,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2022-01-10 03:02:09,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9b2ba22/1c69a5e647c549a5a608bd85b66f83bf/FLAG2c301dbd6 [2022-01-10 03:02:10,219 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:02:10,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2022-01-10 03:02:10,227 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9b2ba22/1c69a5e647c549a5a608bd85b66f83bf/FLAG2c301dbd6 [2022-01-10 03:02:10,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9b2ba22/1c69a5e647c549a5a608bd85b66f83bf [2022-01-10 03:02:10,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:02:10,652 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:02:10,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:02:10,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:02:10,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:02:10,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:02:10" (1/1) ... [2022-01-10 03:02:10,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f5b436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:10, skipping insertion in model container [2022-01-10 03:02:10,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:02:10" (1/1) ... [2022-01-10 03:02:10,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:02:10,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:02:10,854 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/cohendiv-ll_unwindbound1.c[576,589] [2022-01-10 03:02:10,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:02:10,886 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:02:10,907 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/cohendiv-ll_unwindbound1.c[576,589] [2022-01-10 03:02:10,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:02:10,947 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:02:10,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:10 WrapperNode [2022-01-10 03:02:10,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:02:10,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:02:10,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:02:10,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:02:10,969 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:02:10" (1/1) ... [2022-01-10 03:02:10,974 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:02:10" (1/1) ... [2022-01-10 03:02:10,999 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2022-01-10 03:02:11,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:02:11,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:02:11,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:02:11,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:02:11,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:10" (1/1) ... [2022-01-10 03:02:11,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:10" (1/1) ... [2022-01-10 03:02:11,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:10" (1/1) ... [2022-01-10 03:02:11,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:10" (1/1) ... [2022-01-10 03:02:11,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:10" (1/1) ... [2022-01-10 03:02:11,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:10" (1/1) ... [2022-01-10 03:02:11,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:10" (1/1) ... [2022-01-10 03:02:11,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:02:11,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:02:11,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:02:11,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:02:11,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:10" (1/1) ... [2022-01-10 03:02:11,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:02:11,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:02:11,067 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:02:11,070 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:02:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:02:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:02:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:02:11,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:02:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:02:11,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:02:11,140 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:02:11,141 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:02:11,235 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:02:11,239 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:02:11,239 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 03:02:11,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:02:11 BoogieIcfgContainer [2022-01-10 03:02:11,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:02:11,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:02:11,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:02:11,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:02:11,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:02:10" (1/3) ... [2022-01-10 03:02:11,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516bf6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:02:11, skipping insertion in model container [2022-01-10 03:02:11,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:02:10" (2/3) ... [2022-01-10 03:02:11,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516bf6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:02:11, skipping insertion in model container [2022-01-10 03:02:11,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:02:11" (3/3) ... [2022-01-10 03:02:11,245 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound1.c [2022-01-10 03:02:11,249 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:02:11,249 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:02:11,277 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:02:11,282 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:02:11,282 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:02:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-10 03:02:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 03:02:11,301 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:11,301 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:11,301 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:11,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash -555122024, now seen corresponding path program 1 times [2022-01-10 03:02:11,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:11,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485914361] [2022-01-10 03:02:11,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:11,317 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:11,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:11,319 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:02:11,344 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:02:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:11,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:02:11,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:11,491 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:02:11,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:02:11,504 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:11,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485914361] [2022-01-10 03:02:11,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485914361] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:02:11,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:02:11,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:02:11,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144775012] [2022-01-10 03:02:11,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:02:11,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:02:11,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:11,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:02:11,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:02:11,535 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:02:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:11,556 INFO L93 Difference]: Finished difference Result 55 states and 87 transitions. [2022-01-10 03:02:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:02:11,558 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2022-01-10 03:02:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:11,562 INFO L225 Difference]: With dead ends: 55 [2022-01-10 03:02:11,562 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 03:02:11,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:02:11,572 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:02:11,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:02:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 03:02:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-10 03:02:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:02:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2022-01-10 03:02:11,598 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 9 [2022-01-10 03:02:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:11,598 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2022-01-10 03:02:11,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:02:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-01-10 03:02:11,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 03:02:11,600 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:11,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:11,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 03:02:11,807 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:02:11,808 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:11,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:11,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1985514477, now seen corresponding path program 1 times [2022-01-10 03:02:11,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:11,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311746263] [2022-01-10 03:02:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:11,812 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:11,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:11,813 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:02:11,815 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:02:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:11,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:02:11,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:11,946 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:02:11,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:02:11,947 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:11,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311746263] [2022-01-10 03:02:11,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311746263] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:02:11,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:02:11,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:02:11,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386975778] [2022-01-10 03:02:11,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:02:11,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:02:11,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:11,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:02:11,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:02:11,952 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:02:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:11,974 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-01-10 03:02:11,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:02:11,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:02:11,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:11,975 INFO L225 Difference]: With dead ends: 34 [2022-01-10 03:02:11,975 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 03:02:11,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:02:11,978 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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:02:11,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:02:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 03:02:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-10 03:02:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:02:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-01-10 03:02:11,985 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 10 [2022-01-10 03:02:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:11,988 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-01-10 03:02:11,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:02:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-01-10 03:02:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 03:02:11,991 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:11,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:11,999 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:02:12,192 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:02:12,193 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:12,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:12,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1984024927, now seen corresponding path program 1 times [2022-01-10 03:02:12,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:12,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176491713] [2022-01-10 03:02:12,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:12,194 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:12,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:12,203 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:02:12,206 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:02:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:12,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:02:12,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:12,353 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:02:12,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:02:12,353 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:12,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176491713] [2022-01-10 03:02:12,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176491713] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:02:12,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:02:12,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 03:02:12,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814391543] [2022-01-10 03:02:12,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:02:12,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 03:02:12,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:12,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 03:02:12,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 03:02:12,355 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:02:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:12,988 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-01-10 03:02:12,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 03:02:12,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:02:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:12,990 INFO L225 Difference]: With dead ends: 37 [2022-01-10 03:02:12,990 INFO L226 Difference]: Without dead ends: 35 [2022-01-10 03:02:12,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:02:12,991 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 03:02:12,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 111 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 03:02:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-10 03:02:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-01-10 03:02:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-10 03:02:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-01-10 03:02:12,998 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 10 [2022-01-10 03:02:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:12,998 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-01-10 03:02:12,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:02:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-01-10 03:02:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 03:02:12,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:12,999 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:13,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-01-10 03:02:13,208 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:02:13,209 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:13,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:13,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2084809189, now seen corresponding path program 1 times [2022-01-10 03:02:13,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:13,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78555612] [2022-01-10 03:02:13,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:13,210 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:13,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:13,219 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:02:13,220 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:02:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:13,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:02:13,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:13,496 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:02:13,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:02:13,497 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:13,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78555612] [2022-01-10 03:02:13,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78555612] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:02:13,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:02:13,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 03:02:13,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682697555] [2022-01-10 03:02:13,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:02:13,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 03:02:13,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:13,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 03:02:13,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 03:02:13,498 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:02:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:14,206 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-01-10 03:02:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 03:02:14,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 15 [2022-01-10 03:02:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:14,212 INFO L225 Difference]: With dead ends: 50 [2022-01-10 03:02:14,212 INFO L226 Difference]: Without dead ends: 47 [2022-01-10 03:02:14,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:02:14,213 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 60 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 03:02:14,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 121 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 03:02:14,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-10 03:02:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-01-10 03:02:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-10 03:02:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-01-10 03:02:14,221 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 15 [2022-01-10 03:02:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:14,221 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-01-10 03:02:14,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:02:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-01-10 03:02:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 03:02:14,222 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:14,222 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:14,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-01-10 03:02:14,429 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:02:14,430 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:14,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:14,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2002825724, now seen corresponding path program 1 times [2022-01-10 03:02:14,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:14,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667336913] [2022-01-10 03:02:14,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:14,431 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:14,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:14,432 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:02:14,433 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:02:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:14,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:02:14,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:02:14,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:02:14,595 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:14,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667336913] [2022-01-10 03:02:14,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667336913] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:02:14,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:02:14,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 03:02:14,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677243864] [2022-01-10 03:02:14,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:02:14,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:02:14,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:14,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:02:14,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:02:14,596 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:02:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:14,803 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2022-01-10 03:02:14,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:02:14,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-01-10 03:02:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:14,804 INFO L225 Difference]: With dead ends: 73 [2022-01-10 03:02:14,804 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 03:02:14,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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:02:14,805 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:02:14,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 03:02:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 03:02:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-01-10 03:02:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 03:02:14,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-01-10 03:02:14,810 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 23 [2022-01-10 03:02:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:14,810 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-01-10 03:02:14,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:02:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-01-10 03:02:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 03:02:14,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:14,810 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:14,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-01-10 03:02:15,018 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:02:15,019 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash -840648207, now seen corresponding path program 1 times [2022-01-10 03:02:15,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:15,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629372646] [2022-01-10 03:02:15,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:15,020 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:15,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:15,021 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:02:15,023 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:02:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:15,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 03:02:15,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:02:15,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:02:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:02:22,144 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:22,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629372646] [2022-01-10 03:02:22,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629372646] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:02:22,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:02:22,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-01-10 03:02:22,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023829211] [2022-01-10 03:02:22,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:02:22,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 03:02:22,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:22,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 03:02:22,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-01-10 03:02:22,145 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:02:27,522 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:02:31,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:02:34,610 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:02:39,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:02:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:42,165 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2022-01-10 03:02:42,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 03:02:42,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-01-10 03:02:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:42,177 INFO L225 Difference]: With dead ends: 71 [2022-01-10 03:02:42,177 INFO L226 Difference]: Without dead ends: 68 [2022-01-10 03:02:42,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-01-10 03:02:42,177 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 25 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 23 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2022-01-10 03:02:42,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 180 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 69 Invalid, 4 Unknown, 0 Unchecked, 16.7s Time] [2022-01-10 03:02:42,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-10 03:02:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2022-01-10 03:02:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-01-10 03:02:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2022-01-10 03:02:42,208 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 26 [2022-01-10 03:02:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:42,208 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2022-01-10 03:02:42,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:02:42,208 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2022-01-10 03:02:42,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 03:02:42,208 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:02:42,208 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:42,221 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:02:42,417 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:02:42,418 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:02:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:02:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash -839158657, now seen corresponding path program 1 times [2022-01-10 03:02:42,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:02:42,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147876039] [2022-01-10 03:02:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:02:42,419 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:02:42,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:02:42,420 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:02:42,422 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:02:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:02:42,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:02:42,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:02:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:02:42,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:02:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:02:42,724 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:02:42,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147876039] [2022-01-10 03:02:42,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147876039] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:02:42,725 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:02:42,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-01-10 03:02:42,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638324766] [2022-01-10 03:02:42,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:02:42,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:02:42,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:02:42,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:02:42,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:02:42,726 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 03:02:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:02:42,970 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-01-10 03:02:42,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:02:42,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2022-01-10 03:02:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:02:42,970 INFO L225 Difference]: With dead ends: 67 [2022-01-10 03:02:42,970 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 03:02:42,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:02:42,971 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:02:42,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 64 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 03:02:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 03:02:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 03:02:42,972 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:02:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 03:02:42,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-01-10 03:02:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:02:42,972 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 03:02:42,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 03:02:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 03:02:42,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 03:02:42,974 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 03:02:42,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-01-10 03:02:43,183 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:02:43,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 03:02:48,761 INFO L861 garLoopResultBuilder]: At program point L64(lines 23 65) the Hoare annotation is: true [2022-01-10 03:02:48,761 INFO L854 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: false [2022-01-10 03:02:48,761 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2022-01-10 03:02:48,761 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 03:02:48,761 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 03:02:48,761 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 03:02:48,761 INFO L858 garLoopResultBuilder]: For program point L49(lines 46 58) no Hoare annotation was computed. [2022-01-10 03:02:48,762 INFO L858 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-01-10 03:02:48,762 INFO L858 garLoopResultBuilder]: For program point L37-1(lines 37 61) no Hoare annotation was computed. [2022-01-10 03:02:48,762 INFO L854 garLoopResultBuilder]: At program point L37-3(lines 37 61) the Hoare annotation is: (let ((.cse0 (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32))) (.cse1 (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))))) (.cse2 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)))) (or (and (= (_ bv2 32) ~counter~0) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 64)) (= ~counter~0 (_ bv0 32)) .cse0 (= |ULTIMATE.start_main_~b~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) .cse1 .cse2))) [2022-01-10 03:02:48,762 INFO L854 garLoopResultBuilder]: At program point L37-4(lines 37 61) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) [2022-01-10 03:02:48,762 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 03:02:48,762 INFO L854 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: false [2022-01-10 03:02:48,762 INFO L858 garLoopResultBuilder]: For program point L54-1(line 54) no Hoare annotation was computed. [2022-01-10 03:02:48,762 INFO L858 garLoopResultBuilder]: For program point L46-1(lines 46 58) no Hoare annotation was computed. [2022-01-10 03:02:48,762 INFO L854 garLoopResultBuilder]: At program point L46-3(lines 46 58) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse1 (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (and (= ~counter~0 (_ bv1 32)) (= (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~r~0#1| .cse1 (bvneg |ULTIMATE.start_main_~b~0#1|)) .cse2) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= .cse2 (bvadd |ULTIMATE.start_main_~r~0#1| .cse1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))))) [2022-01-10 03:02:48,762 INFO L858 garLoopResultBuilder]: For program point L46-4(lines 46 58) no Hoare annotation was computed. [2022-01-10 03:02:48,762 INFO L854 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 64)) (= ~counter~0 (_ bv1 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|) (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) [2022-01-10 03:02:48,762 INFO L854 garLoopResultBuilder]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (.cse1 (bvmul |ULTIMATE.start_main_~q~0#1| .cse0))) (and (= ~counter~0 (_ bv1 32)) (= (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| .cse0) |ULTIMATE.start_main_~r~0#1| .cse1 (bvneg |ULTIMATE.start_main_~b~0#1|)) .cse2) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= .cse2 (bvadd |ULTIMATE.start_main_~r~0#1| .cse1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))))) [2022-01-10 03:02:48,762 INFO L858 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2022-01-10 03:02:48,763 INFO L854 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: false [2022-01-10 03:02:48,763 INFO L854 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: false [2022-01-10 03:02:48,763 INFO L858 garLoopResultBuilder]: For program point L39(lines 37 61) no Hoare annotation was computed. [2022-01-10 03:02:48,763 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-01-10 03:02:48,763 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-01-10 03:02:48,763 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-01-10 03:02:48,763 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-01-10 03:02:48,763 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-01-10 03:02:48,763 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-01-10 03:02:48,765 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:02:48,766 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 03:02:48,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:02:48 BoogieIcfgContainer [2022-01-10 03:02:48,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 03:02:48,776 INFO L158 Benchmark]: Toolchain (without parser) took 38124.50ms. Allocated memory was 162.5MB in the beginning and 250.6MB in the end (delta: 88.1MB). Free memory was 105.6MB in the beginning and 142.7MB in the end (delta: -37.0MB). Peak memory consumption was 51.9MB. Max. memory is 8.0GB. [2022-01-10 03:02:48,776 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 162.5MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 03:02:48,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.28ms. Allocated memory was 162.5MB in the beginning and 250.6MB in the end (delta: 88.1MB). Free memory was 105.5MB in the beginning and 223.2MB in the end (delta: -117.7MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-01-10 03:02:48,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.56ms. Allocated memory is still 250.6MB. Free memory was 223.2MB in the beginning and 221.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 03:02:48,777 INFO L158 Benchmark]: Boogie Preprocessor took 16.42ms. Allocated memory is still 250.6MB. Free memory was 221.6MB in the beginning and 220.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:02:48,777 INFO L158 Benchmark]: RCFGBuilder took 223.13ms. Allocated memory is still 250.6MB. Free memory was 220.6MB in the beginning and 209.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 03:02:48,777 INFO L158 Benchmark]: TraceAbstraction took 37534.45ms. Allocated memory is still 250.6MB. Free memory was 208.5MB in the beginning and 142.7MB in the end (delta: 65.8MB). Peak memory consumption was 65.8MB. Max. memory is 8.0GB. [2022-01-10 03:02:48,778 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.11ms. Allocated memory is still 162.5MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 299.28ms. Allocated memory was 162.5MB in the beginning and 250.6MB in the end (delta: 88.1MB). Free memory was 105.5MB in the beginning and 223.2MB in the end (delta: -117.7MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.56ms. Allocated memory is still 250.6MB. Free memory was 223.2MB in the beginning and 221.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.42ms. Allocated memory is still 250.6MB. Free memory was 221.6MB in the beginning and 220.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 223.13ms. Allocated memory is still 250.6MB. Free memory was 220.6MB in the beginning and 209.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 37534.45ms. Allocated memory is still 250.6MB. Free memory was 208.5MB in the beginning and 142.7MB in the end (delta: 65.8MB). Peak memory consumption was 65.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.5s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 18.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 722 SdHoareTripleChecker+Invalid, 17.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 504 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223 IncrementalHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 218 mSDtfsCounter, 223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=6, InterpolantAutomatonStates: 39, 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, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 49 PreInvPairs, 57 NumberOfFragments, 172 HoareAnnotationTreeSize, 49 FomulaSimplifications, 4 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 153 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 801 SizeOfPredicates, 15 NumberOfNonLiveVariables, 292 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 46/52 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: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((counter == 1bv32 && ~bvadd16(~bvmul32(a, ~sign_extendFrom8To32(y)), r, ~bvmul32(q, ~sign_extendFrom8To32(y)), ~bvneg64(b)) == ~sign_extendFrom8To32(x)) && ~bvsge64(y, 1bv32)) && q == 0bv64) && ~sign_extendFrom8To32(x) == ~bvadd16(r, ~bvmul32(q, ~sign_extendFrom8To32(y)))) && cond == 1bv32 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((2bv32 == counter && ~bvsge64(y, 1bv32)) && ~sign_extendFrom8To32(x) == ~bvadd16(r, ~bvmul32(q, ~sign_extendFrom8To32(y)))) && cond == 1bv32) || ((((((a == 0bv64 && counter == 0bv32) && ~bvsge64(y, 1bv32)) && b == 0bv64) && q == 0bv64) && ~sign_extendFrom8To32(x) == ~bvadd16(r, ~bvmul32(q, ~sign_extendFrom8To32(y)))) && cond == 1bv32) RESULT: Ultimate proved your program to be correct! [2022-01-10 03:02:48,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...