/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/sqrt1-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:33:54,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:33:54,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:33:54,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:33:54,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:33:54,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:33:54,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:33:54,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:33:54,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:33:54,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:33:54,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:33:54,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:33:54,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:33:54,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:33:54,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:33:54,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:33:54,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:33:54,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:33:54,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:33:54,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:33:54,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:33:54,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:33:54,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:33:54,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:33:54,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:33:54,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:33:54,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:33:54,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:33:54,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:33:54,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:33:54,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:33:54,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:33:54,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:33:54,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:33:54,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:33:54,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:33:54,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:33:54,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:33:54,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:33:54,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:33:54,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:33:54,384 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:33:54,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:33:54,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:33:54,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:33:54,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:33:54,403 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:33:54,403 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:33:54,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:33:54,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:33:54,403 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:33:54,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:33:54,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:33:54,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:33:54,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:33:54,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:33:54,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:33:54,404 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:33:54,404 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:33:54,405 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:33:54,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:33:54,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:33:54,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:33:54,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:33:54,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:33:54,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:33:54,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:33:54,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:33:54,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:33:54,406 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:33:54,406 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:33:54,406 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:33:54,406 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:33:54,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:33:54,406 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:33:54,407 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:33:54,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:33:54,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:33:54,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:33:54,593 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:33:54,594 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:33:54,595 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound5.c [2022-01-10 03:33:54,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3abc2ee3/90c5eb2e6d4842bfa632216937697543/FLAG6352c09bb [2022-01-10 03:33:54,933 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:33:54,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound5.c [2022-01-10 03:33:54,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3abc2ee3/90c5eb2e6d4842bfa632216937697543/FLAG6352c09bb [2022-01-10 03:33:55,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3abc2ee3/90c5eb2e6d4842bfa632216937697543 [2022-01-10 03:33:55,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:33:55,373 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:33:55,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:33:55,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:33:55,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:33:55,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:33:55" (1/1) ... [2022-01-10 03:33:55,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1b4f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:33:55, skipping insertion in model container [2022-01-10 03:33:55,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:33:55" (1/1) ... [2022-01-10 03:33:55,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:33:55,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:33:55,579 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/sqrt1-ll_valuebound5.c[520,533] [2022-01-10 03:33:55,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:33:55,610 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:33:55,621 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/sqrt1-ll_valuebound5.c[520,533] [2022-01-10 03:33:55,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:33:55,647 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:33:55,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:33:55 WrapperNode [2022-01-10 03:33:55,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:33:55,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:33:55,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:33:55,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:33:55,659 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:33:55" (1/1) ... [2022-01-10 03:33:55,666 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:33:55" (1/1) ... [2022-01-10 03:33:55,679 INFO L137 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2022-01-10 03:33:55,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:33:55,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:33:55,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:33:55,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:33:55,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:33:55" (1/1) ... [2022-01-10 03:33:55,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:33:55" (1/1) ... [2022-01-10 03:33:55,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:33:55" (1/1) ... [2022-01-10 03:33:55,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:33:55" (1/1) ... [2022-01-10 03:33:55,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:33:55" (1/1) ... [2022-01-10 03:33:55,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:33:55" (1/1) ... [2022-01-10 03:33:55,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:33:55" (1/1) ... [2022-01-10 03:33:55,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:33:55,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:33:55,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:33:55,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:33:55,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:33:55" (1/1) ... [2022-01-10 03:33:55,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:33:55,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:33:55,752 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:33:55,789 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:33:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:33:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:33:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:33:55,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:33:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:33:55,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:33:55,839 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:33:55,840 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:33:55,958 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:33:55,961 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:33:55,961 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 03:33:55,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:33:55 BoogieIcfgContainer [2022-01-10 03:33:55,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:33:55,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:33:55,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:33:55,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:33:55,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:33:55" (1/3) ... [2022-01-10 03:33:55,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157d4d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:33:55, skipping insertion in model container [2022-01-10 03:33:55,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:33:55" (2/3) ... [2022-01-10 03:33:55,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157d4d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:33:55, skipping insertion in model container [2022-01-10 03:33:55,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:33:55" (3/3) ... [2022-01-10 03:33:55,969 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound5.c [2022-01-10 03:33:55,972 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:33:55,972 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:33:56,035 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:33:56,041 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:33:56,042 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:33:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:33:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 03:33:56,083 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:33:56,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:33:56,084 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:33:56,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:33:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash -589224774, now seen corresponding path program 1 times [2022-01-10 03:33:56,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:33:56,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866938670] [2022-01-10 03:33:56,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:33:56,109 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:33:56,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:33:56,125 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:33:56,126 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:33:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:33:56,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:33:56,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:33:56,228 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:33:56,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:33:56,228 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:33:56,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866938670] [2022-01-10 03:33:56,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866938670] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:33:56,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:33:56,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:33:56,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632434240] [2022-01-10 03:33:56,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:33:56,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:33:56,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:33:56,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:33:56,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:33:56,260 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:33:56,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:33:56,276 INFO L93 Difference]: Finished difference Result 41 states and 64 transitions. [2022-01-10 03:33:56,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:33:56,279 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-01-10 03:33:56,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:33:56,284 INFO L225 Difference]: With dead ends: 41 [2022-01-10 03:33:56,284 INFO L226 Difference]: Without dead ends: 18 [2022-01-10 03:33:56,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:33:56,289 INFO L933 BasicCegarLoop]: 27 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, 27 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:33:56,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:33:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-10 03:33:56,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-10 03:33:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 03:33:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-01-10 03:33:56,318 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 9 [2022-01-10 03:33:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:33:56,319 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-01-10 03:33:56,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:33:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-01-10 03:33:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 03:33:56,320 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:33:56,320 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:33:56,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 03:33:56,545 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:33:56,546 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:33:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:33:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1187450884, now seen corresponding path program 1 times [2022-01-10 03:33:56,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:33:56,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096752399] [2022-01-10 03:33:56,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:33:56,548 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:33:56,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:33:56,549 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:33:56,550 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:33:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:33:56,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:33:56,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:33:56,632 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:33:56,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:33:56,632 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:33:56,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096752399] [2022-01-10 03:33:56,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096752399] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:33:56,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:33:56,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:33:56,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844105459] [2022-01-10 03:33:56,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:33:56,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:33:56,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:33:56,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:33:56,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:33:56,635 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:33:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:33:56,801 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-01-10 03:33:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:33:56,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-01-10 03:33:56,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:33:56,802 INFO L225 Difference]: With dead ends: 32 [2022-01-10 03:33:56,802 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 03:33:56,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:33:56,803 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:33:56,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 81 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:33:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 03:33:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-01-10 03:33:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-10 03:33:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-01-10 03:33:56,810 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 9 [2022-01-10 03:33:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:33:56,811 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-01-10 03:33:56,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:33:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-01-10 03:33:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 03:33:56,811 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:33:56,811 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:33:56,820 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:33:57,017 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:33:57,018 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:33:57,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:33:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1170702338, now seen corresponding path program 1 times [2022-01-10 03:33:57,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:33:57,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87529938] [2022-01-10 03:33:57,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:33:57,019 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:33:57,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:33:57,020 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:33:57,022 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:33:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:33:57,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:33:57,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:33:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:33:57,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:33:57,166 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:33:57,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87529938] [2022-01-10 03:33:57,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87529938] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:33:57,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:33:57,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:33:57,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060961255] [2022-01-10 03:33:57,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:33:57,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:33:57,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:33:57,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:33:57,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:33:57,168 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:33:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:33:57,491 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-01-10 03:33:57,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:33:57,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-01-10 03:33:57,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:33:57,501 INFO L225 Difference]: With dead ends: 36 [2022-01-10 03:33:57,501 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 03:33:57,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:33:57,502 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 03:33:57,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 03:33:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 03:33:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-01-10 03:33:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:33:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-01-10 03:33:57,508 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 14 [2022-01-10 03:33:57,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:33:57,509 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-01-10 03:33:57,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:33:57,509 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-01-10 03:33:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 03:33:57,509 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:33:57,510 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:33:57,517 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:33:57,717 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:33:57,717 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:33:57,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:33:57,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1035962748, now seen corresponding path program 1 times [2022-01-10 03:33:57,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:33:57,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088219191] [2022-01-10 03:33:57,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:33:57,718 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:33:57,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:33:57,721 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:33:57,723 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:33:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:33:57,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:33:57,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:33:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:33:57,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:33:57,891 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:33:57,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088219191] [2022-01-10 03:33:57,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088219191] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:33:57,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:33:57,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:33:57,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236683101] [2022-01-10 03:33:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:33:57,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:33:57,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:33:57,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:33:57,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:33:57,893 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:33:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:33:58,183 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-01-10 03:33:58,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:33:58,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-01-10 03:33:58,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:33:58,191 INFO L225 Difference]: With dead ends: 40 [2022-01-10 03:33:58,191 INFO L226 Difference]: Without dead ends: 35 [2022-01-10 03:33:58,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:33:58,193 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 03:33:58,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 86 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 03:33:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-10 03:33:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-01-10 03:33:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 03:33:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-01-10 03:33:58,200 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2022-01-10 03:33:58,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:33:58,201 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-01-10 03:33:58,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:33:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-01-10 03:33:58,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 03:33:58,201 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:33:58,201 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:33:58,210 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:33:58,402 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:33:58,403 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:33:58,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:33:58,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1637726784, now seen corresponding path program 1 times [2022-01-10 03:33:58,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:33:58,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399552821] [2022-01-10 03:33:58,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:33:58,404 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:33:58,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:33:58,405 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:33:58,407 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:33:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:33:58,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:33:58,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:33:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 03:33:58,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:33:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 03:33:58,758 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:33:58,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399552821] [2022-01-10 03:33:58,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399552821] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:33:58,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:33:58,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-01-10 03:33:58,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936377853] [2022-01-10 03:33:58,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:33:58,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:33:58,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:33:58,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:33:58,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:33:58,760 INFO L87 Difference]: Start difference. First operand 35 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:33:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:33:58,922 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-01-10 03:33:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:33:58,930 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-01-10 03:33:58,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:33:58,931 INFO L225 Difference]: With dead ends: 41 [2022-01-10 03:33:58,931 INFO L226 Difference]: Without dead ends: 39 [2022-01-10 03:33:58,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:33:58,932 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:33:58,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:33:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-10 03:33:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-01-10 03:33:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 03:33:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-01-10 03:33:58,938 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2022-01-10 03:33:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:33:58,939 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-01-10 03:33:58,939 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:33:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-01-10 03:33:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 03:33:58,940 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:33:58,940 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:33:58,951 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:33:59,148 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:33:59,148 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:33:59,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:33:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash 682917830, now seen corresponding path program 2 times [2022-01-10 03:33:59,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:33:59,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018420446] [2022-01-10 03:33:59,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:33:59,150 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:33:59,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:33:59,151 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:33:59,175 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:33:59,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:33:59,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:33:59,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 03:33:59,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:33:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:33:59,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:34:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:34:01,918 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:34:01,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018420446] [2022-01-10 03:34:01,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018420446] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:34:01,918 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:34:01,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 03:34:01,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788706419] [2022-01-10 03:34:01,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:34:01,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:34:01,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:34:01,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:34:01,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:34:01,920 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 03:34:05,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:34:07,830 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:34:10,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:34:12,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:34:14,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:34:16,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:34:19,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:34:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:34:20,292 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2022-01-10 03:34:20,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 03:34:20,300 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 31 [2022-01-10 03:34:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:34:20,301 INFO L225 Difference]: With dead ends: 73 [2022-01-10 03:34:20,301 INFO L226 Difference]: Without dead ends: 68 [2022-01-10 03:34:20,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:34:20,302 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 39 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:34:20,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 139 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 102 Invalid, 7 Unknown, 0 Unchecked, 17.1s Time] [2022-01-10 03:34:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-10 03:34:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2022-01-10 03:34:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-01-10 03:34:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2022-01-10 03:34:20,312 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 31 [2022-01-10 03:34:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:34:20,313 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2022-01-10 03:34:20,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 03:34:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2022-01-10 03:34:20,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-10 03:34:20,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:34:20,314 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-01-10 03:34:20,323 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:34:20,522 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:34:20,523 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:34:20,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:34:20,523 INFO L85 PathProgramCache]: Analyzing trace with hash 614319620, now seen corresponding path program 3 times [2022-01-10 03:34:20,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:34:20,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622533690] [2022-01-10 03:34:20,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 03:34:20,524 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:34:20,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:34:20,527 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:34:20,529 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:34:20,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 03:34:20,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:34:20,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 03:34:20,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:34:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 58 proven. 16 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-01-10 03:34:21,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:35:11,005 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1| (_ BitVec 64))) (or (= (_ bv0 64) (bvadd (bvmul |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_~t~0#1|) (_ bv1 64) (bvneg (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv8 64)) (bvmul (_ bv4 64) (bvmul |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|)) (_ bv4 64))) (bvmul |c_ULTIMATE.start_main_~t~0#1| (_ bv2 64)))) (not (= |c_ULTIMATE.start_main_~t~0#1| (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv2 64)) (_ bv1 64)))))) is different from true [2022-01-10 03:35:11,006 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:35:11,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622533690] [2022-01-10 03:35:11,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622533690] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 03:35:11,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [749971663] [2022-01-10 03:35:11,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 03:35:11,007 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 03:35:11,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 03:35:11,009 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 03:35:11,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-01-10 03:35:11,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 03:35:11,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:35:11,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 03:35:11,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:35:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 03:35:11,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:35:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-01-10 03:35:15,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [749971663] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:35:15,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:35:15,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 7] total 16 [2022-01-10 03:35:15,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010007590] [2022-01-10 03:35:15,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:35:15,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:35:15,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:35:15,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:35:15,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2022-01-10 03:35:15,951 INFO L87 Difference]: Start difference. First operand 64 states and 79 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)