/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_Default.epf -i ../../../trunk/examples/svcomp/bitvector/byte_add-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 22:17:44,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 22:17:44,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 22:17:44,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 22:17:44,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 22:17:44,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 22:17:44,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 22:17:44,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 22:17:44,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 22:17:44,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 22:17:44,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 22:17:44,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 22:17:44,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 22:17:44,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 22:17:44,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 22:17:44,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 22:17:44,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 22:17:44,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 22:17:44,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 22:17:44,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 22:17:44,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 22:17:44,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 22:17:44,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 22:17:44,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 22:17:44,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 22:17:44,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 22:17:44,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 22:17:44,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 22:17:44,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 22:17:44,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 22:17:44,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 22:17:44,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 22:17:44,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 22:17:44,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 22:17:44,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 22:17:44,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 22:17:44,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 22:17:44,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 22:17:44,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 22:17:44,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 22:17:44,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 22:17:44,856 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-09 22:17:44,889 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 22:17:44,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 22:17:44,890 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 22:17:44,890 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 22:17:44,891 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 22:17:44,891 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 22:17:44,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 22:17:44,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 22:17:44,892 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 22:17:44,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 22:17:44,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 22:17:44,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 22:17:44,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 22:17:44,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 22:17:44,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 22:17:44,893 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 22:17:44,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 22:17:44,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 22:17:44,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 22:17:44,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 22:17:44,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 22:17:44,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 22:17:44,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 22:17:44,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 22:17:44,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 22:17:44,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 22:17:44,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 22:17:44,896 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 22:17:44,896 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 22:17:44,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 22:17:44,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-09 22:17:45,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 22:17:45,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 22:17:45,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 22:17:45,163 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 22:17:45,163 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 22:17:45,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add-1.i [2022-01-09 22:17:45,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44fb9424/840de22bfab2438aa46e6c19bb8e3d0d/FLAGf082aeb6c [2022-01-09 22:17:45,535 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 22:17:45,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i [2022-01-09 22:17:45,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44fb9424/840de22bfab2438aa46e6c19bb8e3d0d/FLAGf082aeb6c [2022-01-09 22:17:45,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44fb9424/840de22bfab2438aa46e6c19bb8e3d0d [2022-01-09 22:17:45,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 22:17:45,952 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 22:17:45,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 22:17:45,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 22:17:45,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 22:17:45,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:17:45" (1/1) ... [2022-01-09 22:17:45,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75bb46f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:45, skipping insertion in model container [2022-01-09 22:17:45,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:17:45" (1/1) ... [2022-01-09 22:17:45,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 22:17:45,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 22:17:46,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i[1166,1179] [2022-01-09 22:17:46,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 22:17:46,157 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 22:17:46,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i[1166,1179] [2022-01-09 22:17:46,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 22:17:46,194 INFO L208 MainTranslator]: Completed translation [2022-01-09 22:17:46,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:46 WrapperNode [2022-01-09 22:17:46,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 22:17:46,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 22:17:46,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 22:17:46,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 22:17:46,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:46" (1/1) ... [2022-01-09 22:17:46,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:46" (1/1) ... [2022-01-09 22:17:46,237 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2022-01-09 22:17:46,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 22:17:46,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 22:17:46,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 22:17:46,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 22:17:46,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:46" (1/1) ... [2022-01-09 22:17:46,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:46" (1/1) ... [2022-01-09 22:17:46,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:46" (1/1) ... [2022-01-09 22:17:46,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:46" (1/1) ... [2022-01-09 22:17:46,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:46" (1/1) ... [2022-01-09 22:17:46,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:46" (1/1) ... [2022-01-09 22:17:46,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:46" (1/1) ... [2022-01-09 22:17:46,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 22:17:46,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 22:17:46,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 22:17:46,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 22:17:46,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:46" (1/1) ... [2022-01-09 22:17:46,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 22:17:46,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:17:46,301 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-09 22:17:46,307 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-09 22:17:46,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 22:17:46,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 22:17:46,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 22:17:46,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 22:17:46,394 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 22:17:46,396 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 22:17:46,668 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 22:17:46,673 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 22:17:46,674 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-09 22:17:46,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:17:46 BoogieIcfgContainer [2022-01-09 22:17:46,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 22:17:46,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 22:17:46,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 22:17:46,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 22:17:46,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:17:45" (1/3) ... [2022-01-09 22:17:46,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e874dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:17:46, skipping insertion in model container [2022-01-09 22:17:46,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:17:46" (2/3) ... [2022-01-09 22:17:46,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e874dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:17:46, skipping insertion in model container [2022-01-09 22:17:46,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:17:46" (3/3) ... [2022-01-09 22:17:46,683 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2022-01-09 22:17:46,687 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 22:17:46,687 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 22:17:46,749 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 22:17:46,758 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-09 22:17:46,758 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 22:17:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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-09 22:17:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-09 22:17:46,790 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:46,790 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:46,791 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:46,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:46,795 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2022-01-09 22:17:46,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:46,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310091203] [2022-01-09 22:17:46,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:46,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:46,962 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-09 22:17:46,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:46,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310091203] [2022-01-09 22:17:46,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310091203] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:46,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:17:46,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-09 22:17:46,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201056091] [2022-01-09 22:17:46,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:46,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-09 22:17:46,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:47,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-09 22:17:47,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 22:17:47,011 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-09 22:17:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:47,032 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2022-01-09 22:17:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-09 22:17:47,034 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) Word has length 12 [2022-01-09 22:17:47,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:47,042 INFO L225 Difference]: With dead ends: 57 [2022-01-09 22:17:47,042 INFO L226 Difference]: Without dead ends: 38 [2022-01-09 22:17:47,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-09 22:17:47,050 INFO L933 BasicCegarLoop]: 68 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, 68 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-09 22:17:47,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 22:17:47,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-09 22:17:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-09 22:17:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 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-09 22:17:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2022-01-09 22:17:47,087 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2022-01-09 22:17:47,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:47,087 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2022-01-09 22:17:47,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-09 22:17:47,088 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2022-01-09 22:17:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-09 22:17:47,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:47,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:47,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 22:17:47,091 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2022-01-09 22:17:47,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:47,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078453355] [2022-01-09 22:17:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:47,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:47,239 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-09 22:17:47,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:47,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078453355] [2022-01-09 22:17:47,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078453355] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:47,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:17:47,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 22:17:47,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829005365] [2022-01-09 22:17:47,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:47,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 22:17:47,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:47,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 22:17:47,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 22:17:47,244 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-09 22:17:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:47,396 INFO L93 Difference]: Finished difference Result 89 states and 156 transitions. [2022-01-09 22:17:47,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 22:17:47,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2022-01-09 22:17:47,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:47,398 INFO L225 Difference]: With dead ends: 89 [2022-01-09 22:17:47,399 INFO L226 Difference]: Without dead ends: 61 [2022-01-09 22:17:47,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 22:17:47,400 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:47,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:17:47,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-09 22:17:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-01-09 22:17:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 58 states have internal predecessors, (89), 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-09 22:17:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2022-01-09 22:17:47,413 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 12 [2022-01-09 22:17:47,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:47,413 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2022-01-09 22:17:47,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-09 22:17:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2022-01-09 22:17:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-09 22:17:47,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:47,415 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:47,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 22:17:47,417 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:47,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1336656122, now seen corresponding path program 1 times [2022-01-09 22:17:47,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:47,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323830008] [2022-01-09 22:17:47,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:47,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 22:17:47,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:47,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323830008] [2022-01-09 22:17:47,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323830008] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:47,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:17:47,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 22:17:47,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903424831] [2022-01-09 22:17:47,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:47,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 22:17:47,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:47,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 22:17:47,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 22:17:47,566 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-09 22:17:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:47,735 INFO L93 Difference]: Finished difference Result 143 states and 218 transitions. [2022-01-09 22:17:47,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 22:17:47,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 18 [2022-01-09 22:17:47,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:47,740 INFO L225 Difference]: With dead ends: 143 [2022-01-09 22:17:47,740 INFO L226 Difference]: Without dead ends: 105 [2022-01-09 22:17:47,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 22:17:47,747 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 85 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:47,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 156 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:17:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-01-09 22:17:47,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2022-01-09 22:17:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 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-09 22:17:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2022-01-09 22:17:47,764 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 18 [2022-01-09 22:17:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:47,764 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2022-01-09 22:17:47,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-09 22:17:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2022-01-09 22:17:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-09 22:17:47,765 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:47,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:47,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-09 22:17:47,766 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:47,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:47,767 INFO L85 PathProgramCache]: Analyzing trace with hash -640429161, now seen corresponding path program 1 times [2022-01-09 22:17:47,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:47,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901698003] [2022-01-09 22:17:47,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:47,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 22:17:47,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:47,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901698003] [2022-01-09 22:17:47,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901698003] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:47,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:17:47,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 22:17:47,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511882535] [2022-01-09 22:17:47,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:47,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 22:17:47,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:47,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 22:17:47,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 22:17:47,887 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-09 22:17:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:48,059 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2022-01-09 22:17:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 22:17:48,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) Word has length 19 [2022-01-09 22:17:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:48,061 INFO L225 Difference]: With dead ends: 169 [2022-01-09 22:17:48,061 INFO L226 Difference]: Without dead ends: 125 [2022-01-09 22:17:48,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-09 22:17:48,069 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 89 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:48,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 164 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:17:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-01-09 22:17:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 77. [2022-01-09 22:17:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 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-09 22:17:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2022-01-09 22:17:48,076 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 19 [2022-01-09 22:17:48,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:48,076 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2022-01-09 22:17:48,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-09 22:17:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2022-01-09 22:17:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-09 22:17:48,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:48,077 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:48,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-09 22:17:48,078 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:48,078 INFO L85 PathProgramCache]: Analyzing trace with hash -170409323, now seen corresponding path program 1 times [2022-01-09 22:17:48,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:48,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520561540] [2022-01-09 22:17:48,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:48,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:17:48,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:48,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520561540] [2022-01-09 22:17:48,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520561540] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:17:48,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141886567] [2022-01-09 22:17:48,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:48,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:48,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:17:48,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 22:17:48,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-09 22:17:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:48,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-09 22:17:48,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:17:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:17:48,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 22:17:48,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141886567] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:48,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-09 22:17:48,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-01-09 22:17:48,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410934732] [2022-01-09 22:17:48,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:48,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 22:17:48,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 22:17:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-09 22:17:48,393 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-09 22:17:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:48,540 INFO L93 Difference]: Finished difference Result 146 states and 237 transitions. [2022-01-09 22:17:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 22:17:48,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 20 [2022-01-09 22:17:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:48,541 INFO L225 Difference]: With dead ends: 146 [2022-01-09 22:17:48,541 INFO L226 Difference]: Without dead ends: 118 [2022-01-09 22:17:48,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-09 22:17:48,542 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:48,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 73 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:17:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-01-09 22:17:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2022-01-09 22:17:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 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-09 22:17:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2022-01-09 22:17:48,550 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 20 [2022-01-09 22:17:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:48,551 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2022-01-09 22:17:48,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-09 22:17:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2022-01-09 22:17:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-09 22:17:48,552 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:48,552 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:48,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-09 22:17:48,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:48,778 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:48,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:48,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1606169286, now seen corresponding path program 1 times [2022-01-09 22:17:48,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:48,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480728024] [2022-01-09 22:17:48,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:48,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:17:48,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:48,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480728024] [2022-01-09 22:17:48,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480728024] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:17:48,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416903740] [2022-01-09 22:17:48,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:48,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:48,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:17:48,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 22:17:48,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-09 22:17:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:48,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-09 22:17:48,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:17:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-09 22:17:49,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 22:17:49,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416903740] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:49,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-09 22:17:49,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-01-09 22:17:49,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270975661] [2022-01-09 22:17:49,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:49,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 22:17:49,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:49,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 22:17:49,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-09 22:17:49,064 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-09 22:17:49,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:49,149 INFO L93 Difference]: Finished difference Result 199 states and 284 transitions. [2022-01-09 22:17:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 22:17:49,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) Word has length 26 [2022-01-09 22:17:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:49,150 INFO L225 Difference]: With dead ends: 199 [2022-01-09 22:17:49,150 INFO L226 Difference]: Without dead ends: 132 [2022-01-09 22:17:49,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-09 22:17:49,154 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:49,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 107 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 57 Invalid, 0 Unknown, 77 Unchecked, 0.1s Time] [2022-01-09 22:17:49,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-01-09 22:17:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 104. [2022-01-09 22:17:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 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-09 22:17:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2022-01-09 22:17:49,175 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 26 [2022-01-09 22:17:49,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:49,175 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2022-01-09 22:17:49,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-09 22:17:49,175 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2022-01-09 22:17:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-09 22:17:49,179 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:49,179 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:49,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-09 22:17:49,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-09 22:17:49,380 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:49,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1853130052, now seen corresponding path program 1 times [2022-01-09 22:17:49,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:49,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356967165] [2022-01-09 22:17:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:49,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-09 22:17:49,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:49,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356967165] [2022-01-09 22:17:49,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356967165] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:49,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:17:49,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 22:17:49,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473557470] [2022-01-09 22:17:49,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:49,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 22:17:49,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:49,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 22:17:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-09 22:17:49,457 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-09 22:17:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:49,650 INFO L93 Difference]: Finished difference Result 282 states and 387 transitions. [2022-01-09 22:17:49,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 22:17:49,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) Word has length 32 [2022-01-09 22:17:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:49,652 INFO L225 Difference]: With dead ends: 282 [2022-01-09 22:17:49,652 INFO L226 Difference]: Without dead ends: 211 [2022-01-09 22:17:49,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-09 22:17:49,655 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 106 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:49,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 91 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 22:17:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-09 22:17:49,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 124. [2022-01-09 22:17:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.3902439024390243) internal successors, (171), 123 states have internal predecessors, (171), 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-09 22:17:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2022-01-09 22:17:49,665 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 32 [2022-01-09 22:17:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:49,665 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2022-01-09 22:17:49,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-09 22:17:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2022-01-09 22:17:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-09 22:17:49,668 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:49,668 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:49,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-09 22:17:49,669 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:49,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:49,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1751644167, now seen corresponding path program 1 times [2022-01-09 22:17:49,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:49,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828909828] [2022-01-09 22:17:49,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:49,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-09 22:17:49,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:49,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828909828] [2022-01-09 22:17:49,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828909828] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:49,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:17:49,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 22:17:49,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133770376] [2022-01-09 22:17:49,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:49,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 22:17:49,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:49,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 22:17:49,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 22:17:49,701 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-09 22:17:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:49,776 INFO L93 Difference]: Finished difference Result 242 states and 342 transitions. [2022-01-09 22:17:49,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 22:17:49,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) Word has length 32 [2022-01-09 22:17:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:49,778 INFO L225 Difference]: With dead ends: 242 [2022-01-09 22:17:49,778 INFO L226 Difference]: Without dead ends: 151 [2022-01-09 22:17:49,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 22:17:49,780 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 27 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:49,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 59 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:17:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-01-09 22:17:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 138. [2022-01-09 22:17:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.4306569343065694) internal successors, (196), 137 states have internal predecessors, (196), 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-09 22:17:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2022-01-09 22:17:49,787 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 32 [2022-01-09 22:17:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:49,788 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2022-01-09 22:17:49,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-09 22:17:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2022-01-09 22:17:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-09 22:17:49,790 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:49,790 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:49,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-09 22:17:49,790 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:49,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:49,790 INFO L85 PathProgramCache]: Analyzing trace with hash 23363195, now seen corresponding path program 1 times [2022-01-09 22:17:49,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:49,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950424958] [2022-01-09 22:17:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:49,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:17:49,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:49,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950424958] [2022-01-09 22:17:49,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950424958] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:17:49,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702390760] [2022-01-09 22:17:49,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:49,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:49,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:17:49,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 22:17:49,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-09 22:17:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:49,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-09 22:17:49,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:17:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-09 22:17:50,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 22:17:50,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702390760] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:50,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-09 22:17:50,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-01-09 22:17:50,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256124555] [2022-01-09 22:17:50,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:50,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 22:17:50,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:50,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 22:17:50,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-09 22:17:50,075 INFO L87 Difference]: Start difference. First operand 138 states and 196 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-09 22:17:50,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:50,154 INFO L93 Difference]: Finished difference Result 249 states and 354 transitions. [2022-01-09 22:17:50,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 22:17:50,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) Word has length 32 [2022-01-09 22:17:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:50,155 INFO L225 Difference]: With dead ends: 249 [2022-01-09 22:17:50,155 INFO L226 Difference]: Without dead ends: 144 [2022-01-09 22:17:50,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-09 22:17:50,158 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:50,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 108 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2022-01-09 22:17:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-01-09 22:17:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2022-01-09 22:17:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.3597122302158273) internal successors, (189), 139 states have internal predecessors, (189), 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-09 22:17:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2022-01-09 22:17:50,162 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 32 [2022-01-09 22:17:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:50,163 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2022-01-09 22:17:50,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-09 22:17:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2022-01-09 22:17:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-09 22:17:50,164 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:50,164 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:50,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-09 22:17:50,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:50,365 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:50,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:50,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1733976503, now seen corresponding path program 1 times [2022-01-09 22:17:50,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:50,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129633195] [2022-01-09 22:17:50,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:50,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 22:17:50,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:50,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129633195] [2022-01-09 22:17:50,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129633195] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:17:50,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592762089] [2022-01-09 22:17:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:50,448 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:50,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:17:50,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 22:17:50,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-09 22:17:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:50,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-09 22:17:50,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:17:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-09 22:17:50,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 22:17:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-09 22:17:50,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592762089] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 22:17:50,710 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 22:17:50,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-01-09 22:17:50,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280527160] [2022-01-09 22:17:50,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 22:17:50,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-09 22:17:50,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:50,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-09 22:17:50,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-09 22:17:50,712 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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-09 22:17:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:51,052 INFO L93 Difference]: Finished difference Result 365 states and 519 transitions. [2022-01-09 22:17:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-09 22:17:51,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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) Word has length 32 [2022-01-09 22:17:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:51,054 INFO L225 Difference]: With dead ends: 365 [2022-01-09 22:17:51,054 INFO L226 Difference]: Without dead ends: 258 [2022-01-09 22:17:51,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-01-09 22:17:51,055 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 286 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:51,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 98 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 346 Invalid, 0 Unknown, 79 Unchecked, 0.3s Time] [2022-01-09 22:17:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-01-09 22:17:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 193. [2022-01-09 22:17:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.4114583333333333) internal successors, (271), 192 states have internal predecessors, (271), 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-09 22:17:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 271 transitions. [2022-01-09 22:17:51,062 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 271 transitions. Word has length 32 [2022-01-09 22:17:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:51,062 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 271 transitions. [2022-01-09 22:17:51,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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-09 22:17:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 271 transitions. [2022-01-09 22:17:51,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-09 22:17:51,063 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:51,063 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:51,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-09 22:17:51,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:51,264 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:51,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:51,264 INFO L85 PathProgramCache]: Analyzing trace with hash 86397356, now seen corresponding path program 2 times [2022-01-09 22:17:51,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:51,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248713453] [2022-01-09 22:17:51,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:51,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-09 22:17:51,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:51,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248713453] [2022-01-09 22:17:51,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248713453] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:51,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:17:51,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 22:17:51,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363660384] [2022-01-09 22:17:51,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:51,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 22:17:51,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:51,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 22:17:51,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-09 22:17:51,328 INFO L87 Difference]: Start difference. First operand 193 states and 271 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-09 22:17:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:51,583 INFO L93 Difference]: Finished difference Result 736 states and 1022 transitions. [2022-01-09 22:17:51,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 22:17:51,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 38 [2022-01-09 22:17:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:51,586 INFO L225 Difference]: With dead ends: 736 [2022-01-09 22:17:51,587 INFO L226 Difference]: Without dead ends: 573 [2022-01-09 22:17:51,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-09 22:17:51,587 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 182 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:51,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 258 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 22:17:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-01-09 22:17:51,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 193. [2022-01-09 22:17:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.4114583333333333) internal successors, (271), 192 states have internal predecessors, (271), 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-09 22:17:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 271 transitions. [2022-01-09 22:17:51,597 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 271 transitions. Word has length 38 [2022-01-09 22:17:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:51,598 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 271 transitions. [2022-01-09 22:17:51,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-09 22:17:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 271 transitions. [2022-01-09 22:17:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-09 22:17:51,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:51,599 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:51,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-09 22:17:51,599 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:51,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash -345904797, now seen corresponding path program 1 times [2022-01-09 22:17:51,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:51,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206569214] [2022-01-09 22:17:51,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:51,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-09 22:17:51,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:51,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206569214] [2022-01-09 22:17:51,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206569214] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:51,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:17:51,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-09 22:17:51,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466814142] [2022-01-09 22:17:51,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:51,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 22:17:51,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:51,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 22:17:51,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-09 22:17:51,672 INFO L87 Difference]: Start difference. First operand 193 states and 271 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-09 22:17:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:51,956 INFO L93 Difference]: Finished difference Result 718 states and 999 transitions. [2022-01-09 22:17:51,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 22:17:51,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) Word has length 39 [2022-01-09 22:17:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:51,958 INFO L225 Difference]: With dead ends: 718 [2022-01-09 22:17:51,958 INFO L226 Difference]: Without dead ends: 556 [2022-01-09 22:17:51,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-09 22:17:51,959 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 171 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:51,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 283 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 22:17:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-01-09 22:17:51,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 193. [2022-01-09 22:17:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.4114583333333333) internal successors, (271), 192 states have internal predecessors, (271), 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-09 22:17:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 271 transitions. [2022-01-09 22:17:51,971 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 271 transitions. Word has length 39 [2022-01-09 22:17:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:51,971 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 271 transitions. [2022-01-09 22:17:51,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-09 22:17:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 271 transitions. [2022-01-09 22:17:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-09 22:17:51,972 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:51,972 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:51,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-09 22:17:51,972 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:51,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash 190859729, now seen corresponding path program 1 times [2022-01-09 22:17:51,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:51,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910593913] [2022-01-09 22:17:51,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:51,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-09 22:17:52,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:52,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910593913] [2022-01-09 22:17:52,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910593913] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:52,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:17:52,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-09 22:17:52,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141824219] [2022-01-09 22:17:52,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:52,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 22:17:52,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:52,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 22:17:52,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-09 22:17:52,059 INFO L87 Difference]: Start difference. First operand 193 states and 271 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-09 22:17:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:52,431 INFO L93 Difference]: Finished difference Result 904 states and 1253 transitions. [2022-01-09 22:17:52,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 22:17:52,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) Word has length 40 [2022-01-09 22:17:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:52,434 INFO L225 Difference]: With dead ends: 904 [2022-01-09 22:17:52,434 INFO L226 Difference]: Without dead ends: 742 [2022-01-09 22:17:52,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-09 22:17:52,435 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 257 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:52,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 481 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-09 22:17:52,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-01-09 22:17:52,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 193. [2022-01-09 22:17:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.4114583333333333) internal successors, (271), 192 states have internal predecessors, (271), 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-09 22:17:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 271 transitions. [2022-01-09 22:17:52,449 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 271 transitions. Word has length 40 [2022-01-09 22:17:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:52,449 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 271 transitions. [2022-01-09 22:17:52,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-09 22:17:52,449 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 271 transitions. [2022-01-09 22:17:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-09 22:17:52,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:52,450 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:52,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-09 22:17:52,450 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:52,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:52,451 INFO L85 PathProgramCache]: Analyzing trace with hash -83899885, now seen corresponding path program 1 times [2022-01-09 22:17:52,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:52,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368243129] [2022-01-09 22:17:52,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:52,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-09 22:17:52,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:52,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368243129] [2022-01-09 22:17:52,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368243129] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:52,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:17:52,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 22:17:52,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552031267] [2022-01-09 22:17:52,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:52,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 22:17:52,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:52,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 22:17:52,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-09 22:17:52,545 INFO L87 Difference]: Start difference. First operand 193 states and 271 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-09 22:17:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:53,047 INFO L93 Difference]: Finished difference Result 948 states and 1307 transitions. [2022-01-09 22:17:53,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-09 22:17:53,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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) Word has length 40 [2022-01-09 22:17:53,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:53,051 INFO L225 Difference]: With dead ends: 948 [2022-01-09 22:17:53,051 INFO L226 Difference]: Without dead ends: 785 [2022-01-09 22:17:53,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-09 22:17:53,052 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 367 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:53,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 666 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-09 22:17:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-01-09 22:17:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 181. [2022-01-09 22:17:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.4055555555555554) internal successors, (253), 180 states have internal predecessors, (253), 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-09 22:17:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 253 transitions. [2022-01-09 22:17:53,067 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 253 transitions. Word has length 40 [2022-01-09 22:17:53,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:53,067 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 253 transitions. [2022-01-09 22:17:53,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-09 22:17:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 253 transitions. [2022-01-09 22:17:53,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-09 22:17:53,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:53,068 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:53,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-09 22:17:53,068 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:53,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:53,068 INFO L85 PathProgramCache]: Analyzing trace with hash -175922243, now seen corresponding path program 1 times [2022-01-09 22:17:53,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:53,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709566992] [2022-01-09 22:17:53,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:53,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-09 22:17:53,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:53,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709566992] [2022-01-09 22:17:53,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709566992] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:53,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:17:53,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 22:17:53,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095392795] [2022-01-09 22:17:53,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:53,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 22:17:53,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:53,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 22:17:53,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-09 22:17:53,101 INFO L87 Difference]: Start difference. First operand 181 states and 253 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-09 22:17:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:53,153 INFO L93 Difference]: Finished difference Result 434 states and 608 transitions. [2022-01-09 22:17:53,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 22:17:53,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) Word has length 45 [2022-01-09 22:17:53,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:53,154 INFO L225 Difference]: With dead ends: 434 [2022-01-09 22:17:53,155 INFO L226 Difference]: Without dead ends: 274 [2022-01-09 22:17:53,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09 22:17:53,155 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 40 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:53,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 223 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 22:17:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-01-09 22:17:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 205. [2022-01-09 22:17:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.4068627450980393) internal successors, (287), 204 states have internal predecessors, (287), 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-09 22:17:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2022-01-09 22:17:53,168 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 45 [2022-01-09 22:17:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:53,168 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2022-01-09 22:17:53,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-09 22:17:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2022-01-09 22:17:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-09 22:17:53,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:53,168 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:53,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-09 22:17:53,169 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:53,169 INFO L85 PathProgramCache]: Analyzing trace with hash -543246986, now seen corresponding path program 1 times [2022-01-09 22:17:53,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:53,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514511544] [2022-01-09 22:17:53,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:53,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-09 22:17:53,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:53,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514511544] [2022-01-09 22:17:53,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514511544] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:17:53,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579004023] [2022-01-09 22:17:53,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:53,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:53,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:17:53,252 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 22:17:53,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-09 22:17:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:53,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-09 22:17:53,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:17:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-09 22:17:53,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 22:17:53,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579004023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:53,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-09 22:17:53,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-01-09 22:17:53,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224697124] [2022-01-09 22:17:53,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:53,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 22:17:53,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:53,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 22:17:53,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-09 22:17:53,467 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-09 22:17:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:53,627 INFO L93 Difference]: Finished difference Result 598 states and 839 transitions. [2022-01-09 22:17:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 22:17:53,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) Word has length 45 [2022-01-09 22:17:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:53,631 INFO L225 Difference]: With dead ends: 598 [2022-01-09 22:17:53,631 INFO L226 Difference]: Without dead ends: 396 [2022-01-09 22:17:53,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-01-09 22:17:53,632 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 64 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:53,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 139 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:17:53,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-01-09 22:17:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 351. [2022-01-09 22:17:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 1.3828571428571428) internal successors, (484), 350 states have internal predecessors, (484), 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-09 22:17:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 484 transitions. [2022-01-09 22:17:53,654 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 484 transitions. Word has length 45 [2022-01-09 22:17:53,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:53,655 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 484 transitions. [2022-01-09 22:17:53,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-09 22:17:53,655 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 484 transitions. [2022-01-09 22:17:53,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-09 22:17:53,655 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:53,655 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:53,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-09 22:17:53,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-09 22:17:53,871 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:53,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1776534260, now seen corresponding path program 1 times [2022-01-09 22:17:53,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:53,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878693880] [2022-01-09 22:17:53,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:53,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-09 22:17:53,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:53,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878693880] [2022-01-09 22:17:53,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878693880] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:17:53,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878556724] [2022-01-09 22:17:53,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:53,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:53,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:17:53,959 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 22:17:53,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-09 22:17:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:54,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-09 22:17:54,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:17:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-09 22:17:54,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 22:17:54,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878556724] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:54,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-09 22:17:54,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2022-01-09 22:17:54,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610659035] [2022-01-09 22:17:54,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:54,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 22:17:54,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:54,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 22:17:54,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-09 22:17:54,442 INFO L87 Difference]: Start difference. First operand 351 states and 484 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-09 22:17:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:54,729 INFO L93 Difference]: Finished difference Result 936 states and 1298 transitions. [2022-01-09 22:17:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 22:17:54,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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) Word has length 46 [2022-01-09 22:17:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:54,731 INFO L225 Difference]: With dead ends: 936 [2022-01-09 22:17:54,731 INFO L226 Difference]: Without dead ends: 599 [2022-01-09 22:17:54,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-01-09 22:17:54,733 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 173 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:54,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 239 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 22:17:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-01-09 22:17:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 515. [2022-01-09 22:17:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.3365758754863812) internal successors, (687), 514 states have internal predecessors, (687), 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-09 22:17:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 687 transitions. [2022-01-09 22:17:54,758 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 687 transitions. Word has length 46 [2022-01-09 22:17:54,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:54,758 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 687 transitions. [2022-01-09 22:17:54,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-09 22:17:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 687 transitions. [2022-01-09 22:17:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-09 22:17:54,759 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:54,759 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:54,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-09 22:17:54,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-09 22:17:54,964 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:54,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1065595819, now seen corresponding path program 1 times [2022-01-09 22:17:54,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:54,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072497644] [2022-01-09 22:17:54,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:54,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-09 22:17:55,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:55,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072497644] [2022-01-09 22:17:55,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072497644] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:55,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 22:17:55,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-09 22:17:55,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050573688] [2022-01-09 22:17:55,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:55,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 22:17:55,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:55,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 22:17:55,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-09 22:17:55,042 INFO L87 Difference]: Start difference. First operand 515 states and 687 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-09 22:17:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:55,584 INFO L93 Difference]: Finished difference Result 2563 states and 3390 transitions. [2022-01-09 22:17:55,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-09 22:17:55,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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) Word has length 47 [2022-01-09 22:17:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:55,590 INFO L225 Difference]: With dead ends: 2563 [2022-01-09 22:17:55,590 INFO L226 Difference]: Without dead ends: 2101 [2022-01-09 22:17:55,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-09 22:17:55,591 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 311 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:55,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 579 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-09 22:17:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2022-01-09 22:17:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 503. [2022-01-09 22:17:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 1.344621513944223) internal successors, (675), 502 states have internal predecessors, (675), 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-09 22:17:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 675 transitions. [2022-01-09 22:17:55,624 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 675 transitions. Word has length 47 [2022-01-09 22:17:55,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:55,624 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 675 transitions. [2022-01-09 22:17:55,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-09 22:17:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 675 transitions. [2022-01-09 22:17:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-09 22:17:55,625 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:55,625 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:55,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-09 22:17:55,625 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:55,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1389589642, now seen corresponding path program 1 times [2022-01-09 22:17:55,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:55,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979816259] [2022-01-09 22:17:55,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:55,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-09 22:17:55,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:55,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979816259] [2022-01-09 22:17:55,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979816259] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:17:55,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76056591] [2022-01-09 22:17:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:55,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:55,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:17:55,732 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 22:17:55,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-09 22:17:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:55,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-09 22:17:55,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:17:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-09 22:17:55,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 22:17:55,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76056591] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:55,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-09 22:17:55,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-01-09 22:17:55,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963262332] [2022-01-09 22:17:55,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:55,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 22:17:55,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:55,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 22:17:55,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-09 22:17:55,990 INFO L87 Difference]: Start difference. First operand 503 states and 675 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-09 22:17:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:56,147 INFO L93 Difference]: Finished difference Result 1521 states and 2034 transitions. [2022-01-09 22:17:56,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 22:17:56,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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) Word has length 49 [2022-01-09 22:17:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:56,150 INFO L225 Difference]: With dead ends: 1521 [2022-01-09 22:17:56,151 INFO L226 Difference]: Without dead ends: 1023 [2022-01-09 22:17:56,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-01-09 22:17:56,152 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 56 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:56,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 133 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 22:17:56,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2022-01-09 22:17:56,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 913. [2022-01-09 22:17:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 1.3333333333333333) internal successors, (1216), 912 states have internal predecessors, (1216), 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-09 22:17:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1216 transitions. [2022-01-09 22:17:56,196 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1216 transitions. Word has length 49 [2022-01-09 22:17:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:56,196 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 1216 transitions. [2022-01-09 22:17:56,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-09 22:17:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1216 transitions. [2022-01-09 22:17:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-09 22:17:56,197 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:56,197 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:56,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-09 22:17:56,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:56,419 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:56,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:56,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2126140849, now seen corresponding path program 1 times [2022-01-09 22:17:56,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:56,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255235334] [2022-01-09 22:17:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:56,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-09 22:17:56,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:56,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255235334] [2022-01-09 22:17:56,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255235334] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:17:56,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704551236] [2022-01-09 22:17:56,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:56,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:56,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:17:56,505 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 22:17:56,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-09 22:17:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:56,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-09 22:17:56,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:17:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-09 22:17:56,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 22:17:56,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704551236] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:56,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-09 22:17:56,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-01-09 22:17:56,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099118187] [2022-01-09 22:17:56,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:56,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-09 22:17:56,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:56,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-09 22:17:56,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-09 22:17:56,885 INFO L87 Difference]: Start difference. First operand 913 states and 1216 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-09 22:17:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:57,153 INFO L93 Difference]: Finished difference Result 2003 states and 2658 transitions. [2022-01-09 22:17:57,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 22:17:57,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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) Word has length 50 [2022-01-09 22:17:57,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:57,158 INFO L225 Difference]: With dead ends: 2003 [2022-01-09 22:17:57,158 INFO L226 Difference]: Without dead ends: 1493 [2022-01-09 22:17:57,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-09 22:17:57,160 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 109 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:57,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 255 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 22:17:57,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2022-01-09 22:17:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1317. [2022-01-09 22:17:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1316 states have (on average 1.3275075987841944) internal successors, (1747), 1316 states have internal predecessors, (1747), 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-09 22:17:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1747 transitions. [2022-01-09 22:17:57,226 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1747 transitions. Word has length 50 [2022-01-09 22:17:57,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:57,226 INFO L470 AbstractCegarLoop]: Abstraction has 1317 states and 1747 transitions. [2022-01-09 22:17:57,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-09 22:17:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1747 transitions. [2022-01-09 22:17:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-09 22:17:57,227 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:57,227 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:57,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-09 22:17:57,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:57,444 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash 48257313, now seen corresponding path program 1 times [2022-01-09 22:17:57,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:57,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197949117] [2022-01-09 22:17:57,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:57,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-09 22:17:57,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 22:17:57,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197949117] [2022-01-09 22:17:57,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197949117] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 22:17:57,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505505895] [2022-01-09 22:17:57,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:57,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:57,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 22:17:57,541 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 22:17:57,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-09 22:17:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 22:17:57,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-09 22:17:57,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 22:17:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-09 22:17:58,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 22:17:58,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505505895] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 22:17:58,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-09 22:17:58,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-01-09 22:17:58,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987710721] [2022-01-09 22:17:58,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 22:17:58,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 22:17:58,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 22:17:58,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 22:17:58,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-09 22:17:58,376 INFO L87 Difference]: Start difference. First operand 1317 states and 1747 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-09 22:17:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 22:17:58,879 INFO L93 Difference]: Finished difference Result 2459 states and 3249 transitions. [2022-01-09 22:17:58,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 22:17:58,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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) Word has length 51 [2022-01-09 22:17:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 22:17:58,885 INFO L225 Difference]: With dead ends: 2459 [2022-01-09 22:17:58,885 INFO L226 Difference]: Without dead ends: 1975 [2022-01-09 22:17:58,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-01-09 22:17:58,887 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 166 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-09 22:17:58,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 456 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-09 22:17:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2022-01-09 22:17:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1733. [2022-01-09 22:17:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.325635103926097) internal successors, (2296), 1732 states have internal predecessors, (2296), 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-09 22:17:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2296 transitions. [2022-01-09 22:17:58,994 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2296 transitions. Word has length 51 [2022-01-09 22:17:58,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 22:17:58,994 INFO L470 AbstractCegarLoop]: Abstraction has 1733 states and 2296 transitions. [2022-01-09 22:17:58,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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-09 22:17:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2296 transitions. [2022-01-09 22:17:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-09 22:17:58,995 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 22:17:58,995 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:59,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-09 22:17:59,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 22:17:59,201 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 22:17:59,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 22:17:59,201 INFO L85 PathProgramCache]: Analyzing trace with hash 945650591, now seen corresponding path program 1 times [2022-01-09 22:17:59,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 22:17:59,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955398235] [2022-01-09 22:17:59,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 22:17:59,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 22:17:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-09 22:17:59,219 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-09 22:17:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-09 22:17:59,245 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-09 22:17:59,245 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-09 22:17:59,246 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-09 22:17:59,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-09 22:17:59,250 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 22:17:59,252 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-09 22:17:59,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:17:59 BoogieIcfgContainer [2022-01-09 22:17:59,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-09 22:17:59,320 INFO L158 Benchmark]: Toolchain (without parser) took 13368.86ms. Allocated memory was 200.3MB in the beginning and 333.4MB in the end (delta: 133.2MB). Free memory was 142.6MB in the beginning and 273.3MB in the end (delta: -130.7MB). Peak memory consumption was 2.7MB. Max. memory is 8.0GB. [2022-01-09 22:17:59,320 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 159.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-09 22:17:59,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.31ms. Allocated memory was 200.3MB in the beginning and 277.9MB in the end (delta: 77.6MB). Free memory was 142.3MB in the beginning and 246.9MB in the end (delta: -104.6MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-01-09 22:17:59,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.72ms. Allocated memory is still 277.9MB. Free memory was 246.4MB in the beginning and 244.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-09 22:17:59,321 INFO L158 Benchmark]: Boogie Preprocessor took 30.86ms. Allocated memory is still 277.9MB. Free memory was 244.5MB in the beginning and 243.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-09 22:17:59,321 INFO L158 Benchmark]: RCFGBuilder took 403.67ms. Allocated memory is still 277.9MB. Free memory was 243.2MB in the beginning and 228.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-09 22:17:59,321 INFO L158 Benchmark]: TraceAbstraction took 12642.46ms. Allocated memory was 277.9MB in the beginning and 333.4MB in the end (delta: 55.6MB). Free memory was 228.0MB in the beginning and 273.3MB in the end (delta: -45.2MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-01-09 22:17:59,322 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 159.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.31ms. Allocated memory was 200.3MB in the beginning and 277.9MB in the end (delta: 77.6MB). Free memory was 142.3MB in the beginning and 246.9MB in the end (delta: -104.6MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.72ms. Allocated memory is still 277.9MB. Free memory was 246.4MB in the beginning and 244.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.86ms. Allocated memory is still 277.9MB. Free memory was 244.5MB in the beginning and 243.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 403.67ms. Allocated memory is still 277.9MB. Free memory was 243.2MB in the beginning and 228.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12642.46ms. Allocated memory was 277.9MB in the beginning and 333.4MB in the end (delta: 55.6MB). Free memory was 228.0MB in the beginning and 273.3MB in the end (delta: -45.2MB). Peak memory consumption was 11.4MB. 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 - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L107] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L108] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L109] COND TRUE i == (unsigned char)1 [L109] r1 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L110] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L111] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L113] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L107] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L108] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L109] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L110] COND TRUE i == (unsigned char)2 [L110] r2 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L111] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L113] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L107] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L108] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L109] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L110] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L111] COND TRUE i == (unsigned char)3 [L111] r3 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L113] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\old(a)=0, \old(b)=0, \result=3, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r=3, r0=0, r1=0, r2=0, r3=0] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2590 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2590 mSDsluCounter, 4695 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 214 IncrementalHoareTripleChecker+Unchecked, 2986 mSDsCounter, 304 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4074 IncrementalHoareTripleChecker+Invalid, 4592 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 304 mSolverCounterUnsat, 1709 mSDtfsCounter, 4074 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 545 GetRequests, 408 SyntacticMatches, 24 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1733occurred in iteration=21, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 4523 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1127 NumberOfCodeBlocks, 1127 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1077 ConstructedInterpolants, 7 QuantifiedInterpolants, 6123 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1123 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 31 InterpolantComputations, 20 PerfectInterpolantSequences, 536/589 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-01-09 22:17:59,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...