/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/ldv-regression/test23-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:50:39,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:50:39,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:50:39,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:50:39,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:50:39,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:50:39,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:50:39,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:50:39,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:50:39,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:50:39,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:50:39,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:50:39,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:50:39,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:50:39,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:50:39,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:50:39,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:50:39,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:50:39,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:50:39,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:50:39,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:50:39,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:50:39,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:50:39,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:50:39,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:50:39,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:50:39,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:50:39,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:50:39,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:50:39,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:50:39,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:50:39,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:50:39,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:50:39,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:50:39,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:50:39,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:50:39,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:50:39,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:50:39,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:50:39,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:50:39,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:50:39,612 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-10 00:50:39,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:50:39,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:50:39,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:50:39,644 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:50:39,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:50:39,645 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:50:39,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:50:39,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:50:39,645 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:50:39,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:50:39,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:50:39,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:50:39,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:50:39,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:50:39,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:50:39,647 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:50:39,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:50:39,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:50:39,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:50:39,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:50:39,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:50:39,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:50:39,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:50:39,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:50:39,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:50:39,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:50:39,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:50:39,650 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:50:39,650 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:50:39,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:50:39,650 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-10 00:50:39,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:50:39,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:50:39,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:50:39,858 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:50:39,859 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:50:39,859 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test23-1.c [2022-01-10 00:50:39,923 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8402633/31d7e6dc98804c60b0655e8f4e4bfcbd/FLAG687ac7348 [2022-01-10 00:50:40,261 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:50:40,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-1.c [2022-01-10 00:50:40,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8402633/31d7e6dc98804c60b0655e8f4e4bfcbd/FLAG687ac7348 [2022-01-10 00:50:40,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8402633/31d7e6dc98804c60b0655e8f4e4bfcbd [2022-01-10 00:50:40,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:50:40,288 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:50:40,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:50:40,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:50:40,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:50:40,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b113e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40, skipping insertion in model container [2022-01-10 00:50:40,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:50:40,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:50:40,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-1.c[1075,1088] [2022-01-10 00:50:40,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:50:40,480 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:50:40,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-1.c[1075,1088] [2022-01-10 00:50:40,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:50:40,508 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:50:40,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40 WrapperNode [2022-01-10 00:50:40,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:50:40,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:50:40,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:50:40,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:50:40,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,540 INFO L137 Inliner]: procedures = 16, calls = 57, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 107 [2022-01-10 00:50:40,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:50:40,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:50:40,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:50:40,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:50:40,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:50:40,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:50:40,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:50:40,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:50:40,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:50:40,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:40,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 00:50:40,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 00:50:40,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:50:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:50:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:50:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2022-01-10 00:50:40,631 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2022-01-10 00:50:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:50:40,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:50:40,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:50:40,712 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:50:40,713 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:50:40,903 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:50:40,908 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:50:40,909 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 00:50:40,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:40 BoogieIcfgContainer [2022-01-10 00:50:40,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:50:40,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:50:40,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:50:40,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:50:40,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:50:40" (1/3) ... [2022-01-10 00:50:40,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b55b20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:50:40, skipping insertion in model container [2022-01-10 00:50:40,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (2/3) ... [2022-01-10 00:50:40,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b55b20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:50:40, skipping insertion in model container [2022-01-10 00:50:40,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:40" (3/3) ... [2022-01-10 00:50:40,917 INFO L111 eAbstractionObserver]: Analyzing ICFG test23-1.c [2022-01-10 00:50:40,922 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:50:40,922 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:50:40,959 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:50:40,965 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:50:40,966 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:50:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:50:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 00:50:40,983 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:40,983 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:40,984 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash -203522095, now seen corresponding path program 1 times [2022-01-10 00:50:40,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:40,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905961392] [2022-01-10 00:50:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:40,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:41,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:50:41,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:41,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905961392] [2022-01-10 00:50:41,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905961392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:50:41,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:50:41,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:50:41,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749667453] [2022-01-10 00:50:41,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:50:41,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 00:50:41,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:41,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 00:50:41,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:50:41,325 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:50:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:41,341 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-01-10 00:50:41,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 00:50:41,342 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-01-10 00:50:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:41,348 INFO L225 Difference]: With dead ends: 32 [2022-01-10 00:50:41,348 INFO L226 Difference]: Without dead ends: 19 [2022-01-10 00:50:41,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:50:41,355 INFO L933 BasicCegarLoop]: 26 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, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:41,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:50:41,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-10 00:50:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-01-10 00:50:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:50:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-01-10 00:50:41,390 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 21 [2022-01-10 00:50:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:41,392 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-01-10 00:50:41,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:50:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-01-10 00:50:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 00:50:41,394 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:41,394 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:41,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:50:41,395 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2074741797, now seen corresponding path program 1 times [2022-01-10 00:50:41,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:41,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989602660] [2022-01-10 00:50:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:41,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:50:42,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:42,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989602660] [2022-01-10 00:50:42,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989602660] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:50:42,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:50:42,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-10 00:50:42,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608085664] [2022-01-10 00:50:42,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:50:42,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 00:50:42,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:42,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 00:50:42,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-10 00:50:42,496 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:50:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:42,756 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-01-10 00:50:42,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 00:50:42,757 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-01-10 00:50:42,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:42,758 INFO L225 Difference]: With dead ends: 42 [2022-01-10 00:50:42,759 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 00:50:42,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-01-10 00:50:42,761 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 51 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:42,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 119 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:50:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 00:50:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-01-10 00:50:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 00:50:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-01-10 00:50:42,769 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2022-01-10 00:50:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:42,769 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-01-10 00:50:42,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:50:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-01-10 00:50:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 00:50:42,770 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:42,770 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:42,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:50:42,771 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:42,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:42,771 INFO L85 PathProgramCache]: Analyzing trace with hash 80597091, now seen corresponding path program 1 times [2022-01-10 00:50:42,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:42,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327788174] [2022-01-10 00:50:42,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:42,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:42,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:42,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327788174] [2022-01-10 00:50:42,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327788174] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:42,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253760514] [2022-01-10 00:50:42,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:42,855 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:42,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:42,859 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-10 00:50:42,888 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-10 00:50:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 00:50:42,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:50:43,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:43,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253760514] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:43,488 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:43,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-01-10 00:50:43,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386954460] [2022-01-10 00:50:43,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:43,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-10 00:50:43,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:43,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-10 00:50:43,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2022-01-10 00:50:43,491 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 30 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 22 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:43,774 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-01-10 00:50:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 00:50:43,775 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 22 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 22 [2022-01-10 00:50:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:43,776 INFO L225 Difference]: With dead ends: 44 [2022-01-10 00:50:43,776 INFO L226 Difference]: Without dead ends: 35 [2022-01-10 00:50:43,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=1233, Unknown=0, NotChecked=0, Total=1406 [2022-01-10 00:50:43,778 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:43,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 340 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 00:50:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-10 00:50:43,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-01-10 00:50:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 00:50:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-10 00:50:43,785 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 22 [2022-01-10 00:50:43,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:43,785 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-10 00:50:43,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 22 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-10 00:50:43,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 00:50:43,786 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:43,786 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:43,815 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-10 00:50:44,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:44,010 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:44,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:44,011 INFO L85 PathProgramCache]: Analyzing trace with hash 338762529, now seen corresponding path program 1 times [2022-01-10 00:50:44,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:44,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831611781] [2022-01-10 00:50:44,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:44,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:44,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:50:44,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:44,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831611781] [2022-01-10 00:50:44,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831611781] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:50:44,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:50:44,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-10 00:50:44,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308009194] [2022-01-10 00:50:44,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:50:44,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 00:50:44,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:44,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 00:50:44,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-10 00:50:44,641 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:50:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:44,866 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-01-10 00:50:44,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 00:50:44,867 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-01-10 00:50:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:44,868 INFO L225 Difference]: With dead ends: 42 [2022-01-10 00:50:44,868 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 00:50:44,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-01-10 00:50:44,869 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:44,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 172 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:50:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 00:50:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2022-01-10 00:50:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 00:50:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-01-10 00:50:44,880 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 22 [2022-01-10 00:50:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:44,881 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-01-10 00:50:44,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:50:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-01-10 00:50:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 00:50:44,882 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:44,882 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] [2022-01-10 00:50:44,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:50:44,882 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:44,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1823127190, now seen corresponding path program 1 times [2022-01-10 00:50:44,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:44,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364169499] [2022-01-10 00:50:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:44,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:45,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:45,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:50:45,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:45,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364169499] [2022-01-10 00:50:45,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364169499] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:45,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857663446] [2022-01-10 00:50:45,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:45,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:45,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:45,549 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-10 00:50:45,551 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-10 00:50:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:45,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-10 00:50:45,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:45,958 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-01-10 00:50:46,188 INFO L353 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-01-10 00:50:46,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 12 [2022-01-10 00:50:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:46,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:46,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2022-01-10 00:50:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:46,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857663446] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:46,809 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:46,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 37 [2022-01-10 00:50:46,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011256689] [2022-01-10 00:50:46,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:46,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-10 00:50:46,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-10 00:50:46,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 00:50:46,811 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 37 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 31 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:47,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:47,452 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-01-10 00:50:47,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 00:50:47,453 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 31 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 24 [2022-01-10 00:50:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:47,453 INFO L225 Difference]: With dead ends: 44 [2022-01-10 00:50:47,454 INFO L226 Difference]: Without dead ends: 39 [2022-01-10 00:50:47,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=270, Invalid=2180, Unknown=0, NotChecked=0, Total=2450 [2022-01-10 00:50:47,455 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:47,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 165 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 208 Invalid, 0 Unknown, 5 Unchecked, 0.1s Time] [2022-01-10 00:50:47,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-10 00:50:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-01-10 00:50:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 00:50:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-10 00:50:47,463 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2022-01-10 00:50:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:47,463 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-10 00:50:47,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 31 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-10 00:50:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 00:50:47,464 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:47,464 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] [2022-01-10 00:50:47,486 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-10 00:50:47,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:47,683 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:47,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash 643074406, now seen corresponding path program 1 times [2022-01-10 00:50:47,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:47,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229102606] [2022-01-10 00:50:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:47,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:48,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:48,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:48,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:48,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229102606] [2022-01-10 00:50:48,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229102606] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:48,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808401546] [2022-01-10 00:50:48,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:48,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:48,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:48,324 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-10 00:50:48,327 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-10 00:50:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:48,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-10 00:50:48,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:48,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-01-10 00:50:48,917 INFO L353 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-01-10 00:50:48,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 12 [2022-01-10 00:50:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:48,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:49,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2022-01-10 00:50:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:49,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808401546] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:49,529 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:49,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 39 [2022-01-10 00:50:49,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78541888] [2022-01-10 00:50:49,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:49,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-10 00:50:49,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:49,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-10 00:50:49,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2022-01-10 00:50:49,532 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 39 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 33 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:50,509 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-01-10 00:50:50,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 00:50:50,509 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 33 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 24 [2022-01-10 00:50:50,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:50,510 INFO L225 Difference]: With dead ends: 43 [2022-01-10 00:50:50,510 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 00:50:50,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=322, Invalid=2870, Unknown=0, NotChecked=0, Total=3192 [2022-01-10 00:50:50,512 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:50,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 264 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 483 Invalid, 0 Unknown, 55 Unchecked, 0.3s Time] [2022-01-10 00:50:50,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 00:50:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-01-10 00:50:50,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 00:50:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-10 00:50:50,520 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 24 [2022-01-10 00:50:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:50,521 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-10 00:50:50,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 33 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-10 00:50:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 00:50:50,522 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:50,522 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:50,547 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-10 00:50:50,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:50,735 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash 381115444, now seen corresponding path program 2 times [2022-01-10 00:50:50,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:50,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115257619] [2022-01-10 00:50:50,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:50,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:51,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:51,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:51,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115257619] [2022-01-10 00:50:51,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115257619] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:51,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375595948] [2022-01-10 00:50:51,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:50:51,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:51,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:51,468 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-10 00:50:51,469 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-10 00:50:51,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:50:51,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:50:51,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 00:50:51,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:51,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-01-10 00:50:51,867 INFO L353 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-01-10 00:50:51,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 12 [2022-01-10 00:50:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:50:51,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:50:52,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375595948] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:52,064 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:52,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 29 [2022-01-10 00:50:52,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399869245] [2022-01-10 00:50:52,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:52,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-10 00:50:52,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:52,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-10 00:50:52,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2022-01-10 00:50:52,066 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 27 states have internal predecessors, (50), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 00:50:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:53,658 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-01-10 00:50:53,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-10 00:50:53,659 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 27 states have internal predecessors, (50), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-01-10 00:50:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:53,665 INFO L225 Difference]: With dead ends: 61 [2022-01-10 00:50:53,665 INFO L226 Difference]: Without dead ends: 56 [2022-01-10 00:50:53,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=423, Invalid=2333, Unknown=0, NotChecked=0, Total=2756 [2022-01-10 00:50:53,671 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:53,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 125 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 229 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-01-10 00:50:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-10 00:50:53,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2022-01-10 00:50:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.0625) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 00:50:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-01-10 00:50:53,706 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 28 [2022-01-10 00:50:53,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:53,707 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-01-10 00:50:53,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 27 states have internal predecessors, (50), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 00:50:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-01-10 00:50:53,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 00:50:53,712 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:53,712 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:53,735 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-10 00:50:53,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:53,931 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:53,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:53,932 INFO L85 PathProgramCache]: Analyzing trace with hash -250699064, now seen corresponding path program 3 times [2022-01-10 00:50:53,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:53,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392612881] [2022-01-10 00:50:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:53,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:55,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:55,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:55,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:55,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392612881] [2022-01-10 00:50:55,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392612881] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:55,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257112837] [2022-01-10 00:50:55,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 00:50:55,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:55,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:55,259 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-10 00:50:55,284 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-10 00:50:55,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-01-10 00:50:55,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:50:55,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-10 00:50:55,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:55,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-01-10 00:51:00,612 INFO L353 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-01-10 00:51:00,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 12 [2022-01-10 00:51:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:51:00,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:51:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:51:03,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257112837] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:51:03,148 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:51:03,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 41 [2022-01-10 00:51:03,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792650414] [2022-01-10 00:51:03,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:51:03,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-10 00:51:03,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:03,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-10 00:51:03,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1428, Unknown=1, NotChecked=0, Total=1640 [2022-01-10 00:51:03,150 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 41 states, 40 states have (on average 1.85) internal successors, (74), 39 states have internal predecessors, (74), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 00:51:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:16,070 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-01-10 00:51:16,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-10 00:51:16,071 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.85) internal successors, (74), 39 states have internal predecessors, (74), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2022-01-10 00:51:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:16,072 INFO L225 Difference]: With dead ends: 77 [2022-01-10 00:51:16,072 INFO L226 Difference]: Without dead ends: 72 [2022-01-10 00:51:16,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=1020, Invalid=4831, Unknown=1, NotChecked=0, Total=5852 [2022-01-10 00:51:16,074 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:16,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 131 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 263 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2022-01-10 00:51:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-10 00:51:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 46. [2022-01-10 00:51:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.05) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 00:51:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-01-10 00:51:16,085 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 36 [2022-01-10 00:51:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:16,085 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-01-10 00:51:16,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.85) internal successors, (74), 39 states have internal predecessors, (74), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 00:51:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-01-10 00:51:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 00:51:16,086 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:16,086 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:16,103 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-10 00:51:16,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:16,292 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:51:16,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:16,292 INFO L85 PathProgramCache]: Analyzing trace with hash -229632676, now seen corresponding path program 4 times [2022-01-10 00:51:16,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:16,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837372805] [2022-01-10 00:51:16,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:16,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 00:51:16,311 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 00:51:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 00:51:16,341 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 00:51:16,341 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 00:51:16,342 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 00:51:16,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 00:51:16,345 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-01-10 00:51:16,347 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 00:51:16,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:51:16 BoogieIcfgContainer [2022-01-10 00:51:16,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 00:51:16,388 INFO L158 Benchmark]: Toolchain (without parser) took 36100.86ms. Allocated memory was 180.4MB in the beginning and 330.3MB in the end (delta: 149.9MB). Free memory was 125.4MB in the beginning and 128.9MB in the end (delta: -3.5MB). Peak memory consumption was 147.0MB. Max. memory is 8.0GB. [2022-01-10 00:51:16,388 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:51:16,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.54ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 125.3MB in the beginning and 245.7MB in the end (delta: -120.4MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-01-10 00:51:16,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.71ms. Allocated memory is still 274.7MB. Free memory was 245.7MB in the beginning and 244.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 00:51:16,389 INFO L158 Benchmark]: Boogie Preprocessor took 20.63ms. Allocated memory is still 274.7MB. Free memory was 244.1MB in the beginning and 242.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 00:51:16,389 INFO L158 Benchmark]: RCFGBuilder took 348.24ms. Allocated memory is still 274.7MB. Free memory was 242.6MB in the beginning and 229.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 00:51:16,389 INFO L158 Benchmark]: TraceAbstraction took 35475.83ms. Allocated memory was 274.7MB in the beginning and 330.3MB in the end (delta: 55.6MB). Free memory was 228.9MB in the beginning and 128.9MB in the end (delta: 100.0MB). Peak memory consumption was 156.6MB. Max. memory is 8.0GB. [2022-01-10 00:51:16,390 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 180.4MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.54ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 125.3MB in the beginning and 245.7MB in the end (delta: -120.4MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.71ms. Allocated memory is still 274.7MB. Free memory was 245.7MB in the beginning and 244.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.63ms. Allocated memory is still 274.7MB. Free memory was 244.1MB in the beginning and 242.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 348.24ms. Allocated memory is still 274.7MB. Free memory was 242.6MB in the beginning and 229.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 35475.83ms. Allocated memory was 274.7MB in the beginning and 330.3MB in the end (delta: 55.6MB). Free memory was 228.9MB in the beginning and 128.9MB in the end (delta: 100.0MB). Peak memory consumption was 156.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 52]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] struct dummy d1, d2; VAL [d1={4:0}, d2={5:0}] [L35] CALL init() [L16] d1.a = __VERIFIER_nondet_int() [L17] d1.b = __VERIFIER_nondet_int() [L19] d2.a = __VERIFIER_nondet_int() [L20] d2.b = __VERIFIER_nondet_int() [L35] RET init() [L36] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L25] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={4:0}, d1={4:0}, d2={5:0}] [L25] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L36] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}, get_dummy()={4:0}] [L36] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L36] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L25] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={4:0}, d1={4:0}, d2={5:0}] [L25] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L36] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}, get_dummy()={4:0}, pd1={4:0}] [L36] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L37] int i = __VERIFIER_nondet_int(); [L38] COND TRUE pd1 != 0 && pd1 == pd2 && i >= 0 && i < 10 [L39] pd2->array[i] = i [L40] int *pa = &pd1->array[i]; [L41] EXPR pd2->array[i] [L41] i = pd2->array[i] - 10 [L42] EXPR \read(*pa) VAL [\read(*pa)=1, d1={4:0}, d2={5:0}, i=-9, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-8, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=1, d1={4:0}, d2={5:0}, i=-8, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-7, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=1, d1={4:0}, d2={5:0}, i=-7, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-6, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=1, d1={4:0}, d2={5:0}, i=-6, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-5, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=1, d1={4:0}, d2={5:0}, i=-5, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-4, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=1, d1={4:0}, d2={5:0}, i=-4, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-3, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=1, d1={4:0}, d2={5:0}, i=-3, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-2, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=1, d1={4:0}, d2={5:0}, i=-2, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-1, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=1, d1={4:0}, d2={5:0}, i=-1, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=0, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=1, d1={4:0}, d2={5:0}, i=0, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=1, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=1, d1={4:0}, d2={5:0}, i=1, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=2, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [\read(*pa)=1, d1={4:0}, d2={5:0}, i=2, pa={4:12}, pd1={4:0}, pd2={4:0}] [L42] COND FALSE !(i <= *pa) [L45] CALL, EXPR check(pd2, i) [L30] EXPR s1->array[i] [L30] return s1->array[i] == i; [L45] RET, EXPR check(pd2, i) [L45] COND TRUE !check(pd2, i) [L52] reach_error() VAL [d1={4:0}, d2={5:0}, i=2, pa={4:12}, pd1={4:0}, pd2={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.4s, OverallIterations: 9, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 1342 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 121 IncrementalHoareTripleChecker+Unchecked, 1191 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1733 IncrementalHoareTripleChecker+Invalid, 2052 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 151 mSDtfsCounter, 1733 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 512 GetRequests, 202 SyntacticMatches, 9 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 3006 ImplicationChecksByTransitivity, 26.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=8, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 86 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 377 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 449 ConstructedInterpolants, 28 QuantifiedInterpolants, 4361 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1188 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 41/288 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 proved your program to be incorrect! [2022-01-10 00:51:16,414 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...