/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:03:46,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:03:46,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:03:46,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:03:46,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:03:46,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:03:46,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:03:46,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:03:46,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:03:46,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:03:46,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:03:46,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:03:46,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:03:46,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:03:46,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:03:46,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:03:46,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:03:46,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:03:46,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:03:46,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:03:46,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:03:46,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:03:46,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:03:46,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:03:46,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:03:46,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:03:46,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:03:46,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:03:46,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:03:46,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:03:46,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:03:46,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:03:46,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:03:46,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:03:46,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:03:46,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:03:46,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:03:46,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:03:46,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:03:46,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:03:46,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:03:46,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 03:03:46,767 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:03:46,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:03:46,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:03:46,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:03:46,769 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:03:46,769 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:03:46,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:03:46,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:03:46,769 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:03:46,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:03:46,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:03:46,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:03:46,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:03:46,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:03:46,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:03:46,771 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:03:46,771 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:03:46,771 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:03:46,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:03:46,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:03:46,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:03:46,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:03:46,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:03:46,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:03:46,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:03:46,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:03:46,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:03:46,772 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:03:46,772 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:03:46,772 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:03:46,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:03:46,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:03:46,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:03:46,772 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 03:03:46,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:03:46,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:03:46,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:03:46,958 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:03:46,959 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:03:46,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2022-01-10 03:03:46,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c132a289/a3822fdea1bb4a9882b8801613f3a56a/FLAG6dd3d89fd [2022-01-10 03:03:47,345 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:03:47,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2022-01-10 03:03:47,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c132a289/a3822fdea1bb4a9882b8801613f3a56a/FLAG6dd3d89fd [2022-01-10 03:03:47,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c132a289/a3822fdea1bb4a9882b8801613f3a56a [2022-01-10 03:03:47,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:03:47,765 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:03:47,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:03:47,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:03:47,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:03:47,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:03:47" (1/1) ... [2022-01-10 03:03:47,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6039bad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:47, skipping insertion in model container [2022-01-10 03:03:47,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:03:47" (1/1) ... [2022-01-10 03:03:47,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:03:47,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:03:47,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c[525,538] [2022-01-10 03:03:47,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:03:47,970 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:03:47,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c[525,538] [2022-01-10 03:03:47,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:03:47,997 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:03:47,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:47 WrapperNode [2022-01-10 03:03:47,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:03:47,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:03:47,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:03:47,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:03:48,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:47" (1/1) ... [2022-01-10 03:03:48,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:47" (1/1) ... [2022-01-10 03:03:48,031 INFO L137 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2022-01-10 03:03:48,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:03:48,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:03:48,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:03:48,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:03:48,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:47" (1/1) ... [2022-01-10 03:03:48,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:47" (1/1) ... [2022-01-10 03:03:48,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:47" (1/1) ... [2022-01-10 03:03:48,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:47" (1/1) ... [2022-01-10 03:03:48,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:47" (1/1) ... [2022-01-10 03:03:48,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:47" (1/1) ... [2022-01-10 03:03:48,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:47" (1/1) ... [2022-01-10 03:03:48,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:03:48,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:03:48,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:03:48,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:03:48,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:47" (1/1) ... [2022-01-10 03:03:48,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:03:48,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:03:48,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 03:03:48,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 03:03:48,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:03:48,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:03:48,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:03:48,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:03:48,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:03:48,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:03:48,145 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:03:48,146 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:03:48,336 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:03:48,341 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:03:48,341 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 03:03:48,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:03:48 BoogieIcfgContainer [2022-01-10 03:03:48,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:03:48,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:03:48,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:03:48,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:03:48,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:03:47" (1/3) ... [2022-01-10 03:03:48,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28fb5b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:03:48, skipping insertion in model container [2022-01-10 03:03:48,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:03:47" (2/3) ... [2022-01-10 03:03:48,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28fb5b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:03:48, skipping insertion in model container [2022-01-10 03:03:48,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:03:48" (3/3) ... [2022-01-10 03:03:48,360 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound2.c [2022-01-10 03:03:48,363 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:03:48,363 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:03:48,391 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:03:48,395 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 03:03:48,396 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:03:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-10 03:03:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 03:03:48,408 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:48,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:48,409 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:48,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:48,414 INFO L85 PathProgramCache]: Analyzing trace with hash -797370321, now seen corresponding path program 1 times [2022-01-10 03:03:48,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:48,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962293006] [2022-01-10 03:03:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:48,422 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:48,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:48,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:03:48,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 03:03:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:48,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:03:48,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:48,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:03:48,572 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:48,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962293006] [2022-01-10 03:03:48,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962293006] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:03:48,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:03:48,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:03:48,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292633451] [2022-01-10 03:03:48,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:03:48,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:03:48,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:48,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:03:48,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:03:48,604 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:48,618 INFO L93 Difference]: Finished difference Result 57 states and 97 transitions. [2022-01-10 03:03:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:03:48,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-01-10 03:03:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:48,624 INFO L225 Difference]: With dead ends: 57 [2022-01-10 03:03:48,625 INFO L226 Difference]: Without dead ends: 26 [2022-01-10 03:03:48,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:03:48,629 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:48,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:03:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-10 03:03:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-10 03:03:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 03:03:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-01-10 03:03:48,654 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 10 [2022-01-10 03:03:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:48,655 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2022-01-10 03:03:48,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-01-10 03:03:48,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 03:03:48,655 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:48,656 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:48,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 03:03:48,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:03:48,864 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:48,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1698606518, now seen corresponding path program 1 times [2022-01-10 03:03:48,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:48,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59306940] [2022-01-10 03:03:48,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:48,866 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:48,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:48,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:03:48,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 03:03:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:48,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:03:48,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:48,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:03:48,985 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:48,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59306940] [2022-01-10 03:03:48,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59306940] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:03:48,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:03:48,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:03:48,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729111171] [2022-01-10 03:03:48,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:03:48,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:03:48,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:48,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:03:49,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:03:49,000 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:49,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:49,041 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-01-10 03:03:49,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:03:49,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-10 03:03:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:49,043 INFO L225 Difference]: With dead ends: 47 [2022-01-10 03:03:49,043 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 03:03:49,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:03:49,045 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:49,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:03:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 03:03:49,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 03:03:49,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 03:03:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-01-10 03:03:49,053 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 12 [2022-01-10 03:03:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:49,054 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2022-01-10 03:03:49,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-01-10 03:03:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 03:03:49,054 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:49,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:49,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 03:03:49,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:03:49,270 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:49,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash 776097594, now seen corresponding path program 1 times [2022-01-10 03:03:49,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:49,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132255192] [2022-01-10 03:03:49,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:49,271 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:49,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:49,273 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:03:49,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 03:03:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:49,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:03:49,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:49,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:03:49,410 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:49,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132255192] [2022-01-10 03:03:49,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132255192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:03:49,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:03:49,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 03:03:49,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464774983] [2022-01-10 03:03:49,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:03:49,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:03:49,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:49,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:03:49,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:03:49,414 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:49,448 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-01-10 03:03:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:03:49,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 03:03:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:49,450 INFO L225 Difference]: With dead ends: 41 [2022-01-10 03:03:49,450 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 03:03:49,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:03:49,451 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:49,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:03:49,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 03:03:49,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-01-10 03:03:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 03:03:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2022-01-10 03:03:49,456 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 13 [2022-01-10 03:03:49,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:49,456 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2022-01-10 03:03:49,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2022-01-10 03:03:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 03:03:49,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:49,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:49,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 03:03:49,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:03:49,686 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:49,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash 777587144, now seen corresponding path program 1 times [2022-01-10 03:03:49,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:49,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109392476] [2022-01-10 03:03:49,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:49,687 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:49,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:49,688 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:03:49,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 03:03:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:49,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 03:03:49,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:49,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:03:49,966 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:49,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109392476] [2022-01-10 03:03:49,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109392476] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:03:49,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:03:49,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 03:03:49,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438616468] [2022-01-10 03:03:49,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:03:49,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 03:03:49,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:49,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 03:03:49,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 03:03:49,967 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:52,624 INFO L93 Difference]: Finished difference Result 64 states and 96 transitions. [2022-01-10 03:03:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 03:03:52,634 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 03:03:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:52,635 INFO L225 Difference]: With dead ends: 64 [2022-01-10 03:03:52,635 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 03:03:52,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:03:52,638 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 47 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:52,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 187 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-10 03:03:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 03:03:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-01-10 03:03:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-10 03:03:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-01-10 03:03:52,646 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 13 [2022-01-10 03:03:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:52,647 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-01-10 03:03:52,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-01-10 03:03:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 03:03:52,647 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:52,647 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:52,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 03:03:52,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:03:52,848 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:52,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash 84493759, now seen corresponding path program 1 times [2022-01-10 03:03:52,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:52,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821479060] [2022-01-10 03:03:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:52,849 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:52,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:52,850 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:03:52,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 03:03:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:52,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:03:52,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:53,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:03:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:53,159 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:53,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821479060] [2022-01-10 03:03:53,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821479060] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:03:53,159 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:03:53,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-01-10 03:03:53,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640538771] [2022-01-10 03:03:53,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:03:53,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 03:03:53,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:53,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 03:03:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 03:03:53,160 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:53,263 INFO L93 Difference]: Finished difference Result 64 states and 93 transitions. [2022-01-10 03:03:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:03:53,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 03:03:53,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:53,266 INFO L225 Difference]: With dead ends: 64 [2022-01-10 03:03:53,266 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 03:03:53,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:03:53,267 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:53,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 197 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:03:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 03:03:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-01-10 03:03:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-10 03:03:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2022-01-10 03:03:53,284 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 15 [2022-01-10 03:03:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:53,284 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2022-01-10 03:03:53,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2022-01-10 03:03:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 03:03:53,285 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:53,285 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:53,295 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:03:53,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:03:53,493 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:53,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:53,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2016757679, now seen corresponding path program 1 times [2022-01-10 03:03:53,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:53,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918067553] [2022-01-10 03:03:53,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:53,494 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:53,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:53,495 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:03:53,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 03:03:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:53,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:03:53,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 03:03:53,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:03:53,696 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:53,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918067553] [2022-01-10 03:03:53,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918067553] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:03:53,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:03:53,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:03:53,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847726940] [2022-01-10 03:03:53,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:03:53,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:03:53,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:53,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:03:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:03:53,697 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:55,444 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-01-10 03:03:55,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:03:55,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 16 [2022-01-10 03:03:55,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:55,467 INFO L225 Difference]: With dead ends: 67 [2022-01-10 03:03:55,467 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 03:03:55,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:03:55,468 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:55,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 143 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-10 03:03:55,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 03:03:55,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-10 03:03:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 03:03:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2022-01-10 03:03:55,479 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 16 [2022-01-10 03:03:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:55,479 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2022-01-10 03:03:55,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-01-10 03:03:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 03:03:55,480 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:55,480 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:55,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 03:03:55,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:03:55,681 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:55,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:55,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2015268129, now seen corresponding path program 1 times [2022-01-10 03:03:55,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:55,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089338170] [2022-01-10 03:03:55,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:55,682 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:55,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:55,683 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:03:55,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 03:03:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:55,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:03:55,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:55,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:03:56,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:56,016 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:56,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089338170] [2022-01-10 03:03:56,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089338170] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:03:56,016 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:03:56,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-01-10 03:03:56,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573806312] [2022-01-10 03:03:56,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:03:56,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:03:56,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:56,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:03:56,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:03:56,017 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:03:57,379 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2022-01-10 03:03:57,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 03:03:57,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 03:03:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:03:57,381 INFO L225 Difference]: With dead ends: 133 [2022-01-10 03:03:57,381 INFO L226 Difference]: Without dead ends: 95 [2022-01-10 03:03:57,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-01-10 03:03:57,382 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 54 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:03:57,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 263 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 03:03:57,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-10 03:03:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2022-01-10 03:03:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 47 states have internal predecessors, (60), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 03:03:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2022-01-10 03:03:57,390 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 16 [2022-01-10 03:03:57,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:03:57,390 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2022-01-10 03:03:57,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:03:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2022-01-10 03:03:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 03:03:57,391 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:03:57,391 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:03:57,411 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:03:57,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:03:57,598 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:03:57,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:03:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1651095472, now seen corresponding path program 1 times [2022-01-10 03:03:57,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:03:57,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355330366] [2022-01-10 03:03:57,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:03:57,599 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:03:57,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:03:57,604 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:03:57,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 03:03:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:03:57,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 03:03:57,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:03:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:58,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:03:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:03:59,946 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:03:59,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355330366] [2022-01-10 03:03:59,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355330366] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:03:59,946 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:03:59,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-01-10 03:03:59,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206447905] [2022-01-10 03:03:59,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:03:59,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 03:03:59,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:03:59,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 03:03:59,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-01-10 03:03:59,948 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:04:06,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:04:06,178 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2022-01-10 03:04:06,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 03:04:06,181 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-01-10 03:04:06,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:04:06,182 INFO L225 Difference]: With dead ends: 78 [2022-01-10 03:04:06,182 INFO L226 Difference]: Without dead ends: 54 [2022-01-10 03:04:06,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-01-10 03:04:06,183 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 81 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-01-10 03:04:06,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 241 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-01-10 03:04:06,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-10 03:04:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-01-10 03:04:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-10 03:04:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2022-01-10 03:04:06,192 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 21 [2022-01-10 03:04:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:04:06,192 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2022-01-10 03:04:06,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:04:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2022-01-10 03:04:06,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 03:04:06,193 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:04:06,193 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:04:06,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 03:04:06,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:04:06,400 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:04:06,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:04:06,401 INFO L85 PathProgramCache]: Analyzing trace with hash -231054963, now seen corresponding path program 1 times [2022-01-10 03:04:06,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:04:06,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022274242] [2022-01-10 03:04:06,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:04:06,402 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:04:06,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:04:06,403 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:04:06,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 03:04:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:04:06,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:04:06,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:04:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 03:04:06,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:04:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 03:04:06,768 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:04:06,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022274242] [2022-01-10 03:04:06,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022274242] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:04:06,768 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:04:06,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-01-10 03:04:06,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632473914] [2022-01-10 03:04:06,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:04:06,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:04:06,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:04:06,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:04:06,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:04:06,769 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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:04:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:04:06,887 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-01-10 03:04:06,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:04:06,887 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 03:04:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:04:06,887 INFO L225 Difference]: With dead ends: 54 [2022-01-10 03:04:06,887 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 03:04:06,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:04:06,888 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:04:06,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 35 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:04:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 03:04:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 03:04:06,889 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:04:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 03:04:06,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-01-10 03:04:06,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:04:06,889 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 03:04:06,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 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:04:06,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 03:04:06,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 03:04:06,891 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 03:04:06,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 03:04:07,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:04:07,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 03:04:08,288 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-01-10 03:04:08,288 INFO L861 garLoopResultBuilder]: At program point L60(lines 20 61) the Hoare annotation is: true [2022-01-10 03:04:08,288 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2022-01-10 03:04:08,288 INFO L858 garLoopResultBuilder]: For program point L52-2(lines 20 61) no Hoare annotation was computed. [2022-01-10 03:04:08,288 INFO L858 garLoopResultBuilder]: For program point L44(lines 38 56) no Hoare annotation was computed. [2022-01-10 03:04:08,288 INFO L854 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (and (not (bvule |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2022-01-10 03:04:08,288 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 03:04:08,288 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 03:04:08,288 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 03:04:08,289 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (.cse1 (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)))) (or (and (not (bvule |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) .cse0 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse1) (and (= (bvadd (bvneg |ULTIMATE.start_main_~n~0#1|) (bvmul |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~r~0#1|) (_ bv0 32)) (bvslt ((_ zero_extend 32) |ULTIMATE.start_main_~n~0#1|) (_ bv1073741823 64)) .cse0 .cse1 (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))))) [2022-01-10 03:04:08,289 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (not (bvule |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2022-01-10 03:04:08,289 INFO L858 garLoopResultBuilder]: For program point L8(lines 8 10) no Hoare annotation was computed. [2022-01-10 03:04:08,289 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 03:04:08,289 INFO L854 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (.cse1 (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)))) (or (and (bvslt ((_ zero_extend 32) |ULTIMATE.start_main_~n~0#1|) (_ bv1073741823 64)) .cse0 .cse1 (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) (and (not (bvule |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) .cse0 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse1))) [2022-01-10 03:04:08,289 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (not (bvule |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2022-01-10 03:04:08,289 INFO L858 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-01-10 03:04:08,289 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 56) no Hoare annotation was computed. [2022-01-10 03:04:08,289 INFO L854 garLoopResultBuilder]: At program point L38-2(lines 38 56) the Hoare annotation is: (and (= (bvadd (bvneg |ULTIMATE.start_main_~n~0#1|) (bvmul |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~r~0#1|) (_ bv0 32)) (bvslt ((_ zero_extend 32) |ULTIMATE.start_main_~n~0#1|) (_ bv1073741823 64)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2022-01-10 03:04:08,289 INFO L858 garLoopResultBuilder]: For program point L30-1(lines 30 35) no Hoare annotation was computed. [2022-01-10 03:04:08,289 INFO L854 garLoopResultBuilder]: At program point L30-3(lines 30 35) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse1 (bvslt ((_ zero_extend 32) |ULTIMATE.start_main_~n~0#1|) (_ bv1073741823 64))) (.cse2 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (.cse3 (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32))) (.cse4 (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32)))) (or (and .cse0 (= ~counter~0 (_ bv0 32)) .cse1 .cse2 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse3 .cse4) (and (= (_ bv4 32) |ULTIMATE.start_main_~q~0#1|) .cse0 (bvule (_ bv1 32) |ULTIMATE.start_main_~n~0#1|) .cse1 .cse2 (= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32)) .cse3 .cse4) (and (= (_ bv0 32) (bvadd (_ bv4294967294 32) ~counter~0)) (= (bvadd (bvneg |ULTIMATE.start_main_~n~0#1|) (bvmul |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~r~0#1|) (_ bv0 32)) .cse1 .cse2 .cse3 .cse4))) [2022-01-10 03:04:08,289 INFO L858 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-01-10 03:04:08,289 INFO L854 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (and (not (bvule |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2022-01-10 03:04:08,290 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (not (bvule |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2022-01-10 03:04:08,290 INFO L854 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (and (not (bvule |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2022-01-10 03:04:08,290 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-01-10 03:04:08,290 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-01-10 03:04:08,290 INFO L858 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-01-10 03:04:08,290 INFO L858 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-01-10 03:04:08,290 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-01-10 03:04:08,290 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-01-10 03:04:08,294 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:04:08,295 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 03:04:08,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:04:08 BoogieIcfgContainer [2022-01-10 03:04:08,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 03:04:08,306 INFO L158 Benchmark]: Toolchain (without parser) took 20540.89ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 172.7MB in the beginning and 134.4MB in the end (delta: 38.3MB). Peak memory consumption was 77.9MB. Max. memory is 8.0GB. [2022-01-10 03:04:08,307 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 198.2MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 03:04:08,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.20ms. Allocated memory is still 198.2MB. Free memory was 172.5MB in the beginning and 170.0MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-01-10 03:04:08,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.79ms. Allocated memory is still 198.2MB. Free memory was 170.0MB in the beginning and 168.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 03:04:08,307 INFO L158 Benchmark]: Boogie Preprocessor took 26.21ms. Allocated memory is still 198.2MB. Free memory was 168.0MB in the beginning and 166.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 03:04:08,307 INFO L158 Benchmark]: RCFGBuilder took 283.46ms. Allocated memory is still 198.2MB. Free memory was 166.6MB in the beginning and 153.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 03:04:08,308 INFO L158 Benchmark]: TraceAbstraction took 19950.55ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 153.2MB in the beginning and 134.4MB in the end (delta: 18.8MB). Peak memory consumption was 59.7MB. Max. memory is 8.0GB. [2022-01-10 03:04:08,309 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.08ms. Allocated memory is still 198.2MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.20ms. Allocated memory is still 198.2MB. Free memory was 172.5MB in the beginning and 170.0MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.79ms. Allocated memory is still 198.2MB. Free memory was 170.0MB in the beginning and 168.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.21ms. Allocated memory is still 198.2MB. Free memory was 168.0MB in the beginning and 166.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 283.46ms. Allocated memory is still 198.2MB. Free memory was 166.6MB in the beginning and 153.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 19950.55ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 153.2MB in the beginning and 134.4MB in the end (delta: 18.8MB). Peak memory consumption was 59.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 1342 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1018 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 324 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=7, InterpolantAutomatonStates: 59, 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, 9 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 98 PreInvPairs, 118 NumberOfFragments, 298 HoareAnnotationTreeSize, 98 FomulaSimplifications, 46 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 470 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 893 SizeOfPredicates, 15 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 73/103 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((r == n && counter == 0bv32) && ~bvslt32(~zero_extendFrom32To64(n), 1073741823bv64)) && cond == 1bv32) && q == 1bv32) && p == 0bv32) && h == 0bv32) || (((((((4bv32 == q && r == n) && ~bvule32(1bv32, n)) && ~bvslt32(~zero_extendFrom32To64(n), 1073741823bv64)) && cond == 1bv32) && ~bvadd16(4294967295bv32, counter) == 0bv32) && p == 0bv32) && h == 0bv32)) || (((((0bv32 == ~bvadd16(4294967294bv32, counter) && ~bvadd16(~bvneg64(n), ~bvmul32(p, p), r) == 0bv32) && ~bvslt32(~zero_extendFrom32To64(n), 1073741823bv64)) && cond == 1bv32) && p == 0bv32) && h == 0bv32) RESULT: Ultimate proved your program to be correct! [2022-01-10 03:04:08,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...