/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/eca-rers2012/Problem14_label06.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:12:51,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:12:51,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:12:51,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:12:51,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:12:51,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:12:51,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:12:51,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:12:51,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:12:51,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:12:51,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:12:51,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:12:51,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:12:51,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:12:51,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:12:51,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:12:51,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:12:51,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:12:51,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:12:51,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:12:51,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:12:51,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:12:51,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:12:51,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:12:51,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:12:51,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:12:51,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:12:51,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:12:51,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:12:51,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:12:51,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:12:51,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:12:51,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:12:51,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:12:51,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:12:51,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:12:51,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:12:51,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:12:51,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:12:51,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:12:51,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:12:51,350 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:12:51,371 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:12:51,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:12:51,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:12:51,372 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:12:51,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:12:51,373 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:12:51,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:12:51,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:12:51,374 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:12:51,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:12:51,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:12:51,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:12:51,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:12:51,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:12:51,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:12:51,374 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:12:51,375 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:12:51,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:12:51,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:12:51,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:12:51,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:12:51,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:12:51,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:12:51,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:12:51,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:12:51,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:12:51,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:12:51,376 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:12:51,376 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:12:51,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:12:51,376 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:12:51,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:12:51,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:12:51,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:12:51,580 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:12:51,580 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:12:51,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label06.c [2022-01-10 00:12:51,647 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0f3caf4/3a6e91e1be1f4180abe4f2f21e11ae59/FLAG81bcfdaa9 [2022-01-10 00:12:52,041 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:12:52,047 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label06.c [2022-01-10 00:12:52,071 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0f3caf4/3a6e91e1be1f4180abe4f2f21e11ae59/FLAG81bcfdaa9 [2022-01-10 00:12:52,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0f3caf4/3a6e91e1be1f4180abe4f2f21e11ae59 [2022-01-10 00:12:52,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:12:52,398 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:12:52,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:12:52,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:12:52,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:12:52,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:12:52" (1/1) ... [2022-01-10 00:12:52,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62dce453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52, skipping insertion in model container [2022-01-10 00:12:52,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:12:52" (1/1) ... [2022-01-10 00:12:52,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:12:52,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:12:52,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label06.c[6235,6248] [2022-01-10 00:12:52,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:12:52,758 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:12:52,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label06.c[6235,6248] [2022-01-10 00:12:52,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:12:52,839 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:12:52,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52 WrapperNode [2022-01-10 00:12:52,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:12:52,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:12:52,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:12:52,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:12:52,846 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:12:52" (1/1) ... [2022-01-10 00:12:52,861 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:12:52" (1/1) ... [2022-01-10 00:12:52,916 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 858 [2022-01-10 00:12:52,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:12:52,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:12:52,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:12:52,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:12:52,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2022-01-10 00:12:52,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2022-01-10 00:12:52,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2022-01-10 00:12:52,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2022-01-10 00:12:52,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2022-01-10 00:12:52,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2022-01-10 00:12:52,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2022-01-10 00:12:52,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:12:52,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:12:52,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:12:52,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:12:53,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (1/1) ... [2022-01-10 00:12:53,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:12:53,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:12:53,037 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:12:53,058 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:12:53,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:12:53,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:12:53,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:12:53,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:12:53,130 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:12:53,132 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:12:53,967 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:12:53,978 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:12:53,978 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 00:12:53,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:12:53 BoogieIcfgContainer [2022-01-10 00:12:53,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:12:53,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:12:53,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:12:53,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:12:53,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:12:52" (1/3) ... [2022-01-10 00:12:53,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a21fd00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:12:53, skipping insertion in model container [2022-01-10 00:12:53,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:52" (2/3) ... [2022-01-10 00:12:53,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a21fd00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:12:53, skipping insertion in model container [2022-01-10 00:12:53,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:12:53" (3/3) ... [2022-01-10 00:12:53,987 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label06.c [2022-01-10 00:12:53,990 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:12:53,990 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:12:54,037 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:12:54,043 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:12:54,043 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:12:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-10 00:12:54,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:54,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:12:54,082 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:54,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1818267785, now seen corresponding path program 1 times [2022-01-10 00:12:54,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:54,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293841101] [2022-01-10 00:12:54,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:54,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:12:54,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:54,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293841101] [2022-01-10 00:12:54,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293841101] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:54,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:54,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:12:54,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785957711] [2022-01-10 00:12:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:54,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:54,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:54,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:54,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:54,377 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:55,160 INFO L93 Difference]: Finished difference Result 685 states and 1216 transitions. [2022-01-10 00:12:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:55,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-01-10 00:12:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:55,174 INFO L225 Difference]: With dead ends: 685 [2022-01-10 00:12:55,174 INFO L226 Difference]: Without dead ends: 360 [2022-01-10 00:12:55,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:55,182 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:55,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 139 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 00:12:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-01-10 00:12:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2022-01-10 00:12:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.4206128133704736) internal successors, (510), 359 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2022-01-10 00:12:55,244 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 61 [2022-01-10 00:12:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:55,244 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2022-01-10 00:12:55,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2022-01-10 00:12:55,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-01-10 00:12:55,248 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:55,248 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:12:55,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:12:55,249 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:55,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:55,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1094221175, now seen corresponding path program 1 times [2022-01-10 00:12:55,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:55,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233114974] [2022-01-10 00:12:55,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:55,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:12:55,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:55,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233114974] [2022-01-10 00:12:55,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233114974] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:55,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:55,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:55,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351644934] [2022-01-10 00:12:55,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:55,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:12:55,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:55,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:12:55,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:12:55,387 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:56,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:56,168 INFO L93 Difference]: Finished difference Result 1074 states and 1446 transitions. [2022-01-10 00:12:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:12:56,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2022-01-10 00:12:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:56,171 INFO L225 Difference]: With dead ends: 1074 [2022-01-10 00:12:56,171 INFO L226 Difference]: Without dead ends: 716 [2022-01-10 00:12:56,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:12:56,173 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:56,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 121 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 00:12:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-01-10 00:12:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2022-01-10 00:12:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.2615384615384615) internal successors, (902), 715 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 902 transitions. [2022-01-10 00:12:56,193 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 902 transitions. Word has length 140 [2022-01-10 00:12:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:56,194 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 902 transitions. [2022-01-10 00:12:56,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 902 transitions. [2022-01-10 00:12:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-01-10 00:12:56,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:56,199 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:12:56,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:12:56,199 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:56,200 INFO L85 PathProgramCache]: Analyzing trace with hash -216480168, now seen corresponding path program 1 times [2022-01-10 00:12:56,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:56,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503400606] [2022-01-10 00:12:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:56,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 00:12:56,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:56,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503400606] [2022-01-10 00:12:56,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503400606] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:12:56,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528143037] [2022-01-10 00:12:56,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:56,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:12:56,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:12:56,328 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:12:56,351 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:12:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:56,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:12:56,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:12:56,776 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:12:56,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:12:56,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528143037] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:56,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:12:56,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-01-10 00:12:56,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032646777] [2022-01-10 00:12:56,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:56,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:56,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:56,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:56,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:12:56,782 INFO L87 Difference]: Start difference. First operand 716 states and 902 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:57,268 INFO L93 Difference]: Finished difference Result 1964 states and 2499 transitions. [2022-01-10 00:12:57,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:57,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2022-01-10 00:12:57,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:57,279 INFO L225 Difference]: With dead ends: 1964 [2022-01-10 00:12:57,280 INFO L226 Difference]: Without dead ends: 1250 [2022-01-10 00:12:57,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:12:57,281 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 121 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:57,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 95 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:12:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2022-01-10 00:12:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2022-01-10 00:12:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.2361889511609288) internal successors, (1544), 1249 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1544 transitions. [2022-01-10 00:12:57,314 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1544 transitions. Word has length 166 [2022-01-10 00:12:57,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:57,315 INFO L470 AbstractCegarLoop]: Abstraction has 1250 states and 1544 transitions. [2022-01-10 00:12:57,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1544 transitions. [2022-01-10 00:12:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-01-10 00:12:57,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:57,319 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:12:57,338 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:12:57,519 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:12:57,520 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:57,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:57,520 INFO L85 PathProgramCache]: Analyzing trace with hash 64556132, now seen corresponding path program 1 times [2022-01-10 00:12:57,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:57,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658772548] [2022-01-10 00:12:57,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:57,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:57,627 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 00:12:57,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:57,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658772548] [2022-01-10 00:12:57,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658772548] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:57,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:57,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:57,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009452535] [2022-01-10 00:12:57,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:57,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:12:57,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:57,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:12:57,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:12:57,630 INFO L87 Difference]: Start difference. First operand 1250 states and 1544 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:58,193 INFO L93 Difference]: Finished difference Result 2705 states and 3353 transitions. [2022-01-10 00:12:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:12:58,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2022-01-10 00:12:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:58,208 INFO L225 Difference]: With dead ends: 2705 [2022-01-10 00:12:58,208 INFO L226 Difference]: Without dead ends: 1606 [2022-01-10 00:12:58,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:12:58,210 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 104 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:58,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 120 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:12:58,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2022-01-10 00:12:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2022-01-10 00:12:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1221183800623054) internal successors, (1801), 1605 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1801 transitions. [2022-01-10 00:12:58,230 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1801 transitions. Word has length 220 [2022-01-10 00:12:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:58,230 INFO L470 AbstractCegarLoop]: Abstraction has 1606 states and 1801 transitions. [2022-01-10 00:12:58,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1801 transitions. [2022-01-10 00:12:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2022-01-10 00:12:58,232 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:58,233 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:12:58,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:12:58,233 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:58,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash 696718706, now seen corresponding path program 1 times [2022-01-10 00:12:58,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:58,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767329335] [2022-01-10 00:12:58,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:58,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 224 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-10 00:12:58,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:58,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767329335] [2022-01-10 00:12:58,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767329335] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:12:58,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26923225] [2022-01-10 00:12:58,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:58,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:12:58,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:12:58,384 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:12:58,385 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:12:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:58,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:12:58,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:12:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-01-10 00:12:58,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:12:58,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26923225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:58,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:12:58,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-01-10 00:12:58,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941825980] [2022-01-10 00:12:58,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:58,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:58,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:58,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:58,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:12:58,925 INFO L87 Difference]: Start difference. First operand 1606 states and 1801 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:59,327 INFO L93 Difference]: Finished difference Result 3388 states and 3901 transitions. [2022-01-10 00:12:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:59,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2022-01-10 00:12:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:59,337 INFO L225 Difference]: With dead ends: 3388 [2022-01-10 00:12:59,341 INFO L226 Difference]: Without dead ends: 1962 [2022-01-10 00:12:59,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:12:59,343 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:59,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:12:59,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2022-01-10 00:12:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2022-01-10 00:12:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1318003365114975) internal successors, (2018), 1783 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:59,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2018 transitions. [2022-01-10 00:12:59,367 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2018 transitions. Word has length 347 [2022-01-10 00:12:59,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:59,368 INFO L470 AbstractCegarLoop]: Abstraction has 1784 states and 2018 transitions. [2022-01-10 00:12:59,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:12:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2018 transitions. [2022-01-10 00:12:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2022-01-10 00:12:59,371 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:59,371 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:12:59,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-10 00:12:59,583 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:12:59,583 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:59,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1460708036, now seen corresponding path program 1 times [2022-01-10 00:12:59,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:59,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736529628] [2022-01-10 00:12:59,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:59,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-01-10 00:12:59,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:59,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736529628] [2022-01-10 00:12:59,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736529628] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:59,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:59,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:59,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042425425] [2022-01-10 00:12:59,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:59,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:59,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:59,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:59,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:59,678 INFO L87 Difference]: Start difference. First operand 1784 states and 2018 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:00,083 INFO L93 Difference]: Finished difference Result 3744 states and 4282 transitions. [2022-01-10 00:13:00,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:00,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 351 [2022-01-10 00:13:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:00,089 INFO L225 Difference]: With dead ends: 3744 [2022-01-10 00:13:00,089 INFO L226 Difference]: Without dead ends: 2140 [2022-01-10 00:13:00,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:00,092 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 101 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:00,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 77 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:13:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2022-01-10 00:13:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2022-01-10 00:13:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.1280972417017299) internal successors, (2413), 2139 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2413 transitions. [2022-01-10 00:13:00,121 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2413 transitions. Word has length 351 [2022-01-10 00:13:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:00,122 INFO L470 AbstractCegarLoop]: Abstraction has 2140 states and 2413 transitions. [2022-01-10 00:13:00,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2413 transitions. [2022-01-10 00:13:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2022-01-10 00:13:00,125 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:00,125 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2022-01-10 00:13:00,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:13:00,125 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:00,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1192788200, now seen corresponding path program 1 times [2022-01-10 00:13:00,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:00,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115495414] [2022-01-10 00:13:00,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:00,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2022-01-10 00:13:00,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:00,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115495414] [2022-01-10 00:13:00,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115495414] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:00,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:13:00,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:13:00,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186718376] [2022-01-10 00:13:00,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:00,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:00,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:00,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:00,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:00,211 INFO L87 Difference]: Start difference. First operand 2140 states and 2413 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:00,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:00,623 INFO L93 Difference]: Finished difference Result 4634 states and 5316 transitions. [2022-01-10 00:13:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:00,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 378 [2022-01-10 00:13:00,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:00,630 INFO L225 Difference]: With dead ends: 4634 [2022-01-10 00:13:00,631 INFO L226 Difference]: Without dead ends: 2674 [2022-01-10 00:13:00,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:00,633 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 126 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:00,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 67 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:13:00,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2022-01-10 00:13:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2022-01-10 00:13:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.131635735865343) internal successors, (2622), 2317 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2622 transitions. [2022-01-10 00:13:00,697 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2622 transitions. Word has length 378 [2022-01-10 00:13:00,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:00,698 INFO L470 AbstractCegarLoop]: Abstraction has 2318 states and 2622 transitions. [2022-01-10 00:13:00,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2622 transitions. [2022-01-10 00:13:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2022-01-10 00:13:00,701 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:00,701 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:00,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 00:13:00,701 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:00,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:00,702 INFO L85 PathProgramCache]: Analyzing trace with hash 529160561, now seen corresponding path program 1 times [2022-01-10 00:13:00,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:00,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634474445] [2022-01-10 00:13:00,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:00,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2022-01-10 00:13:00,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:00,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634474445] [2022-01-10 00:13:00,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634474445] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:13:00,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7760106] [2022-01-10 00:13:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:00,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:00,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:13:00,813 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:13:00,814 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:13:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:00,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:13:00,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:13:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2022-01-10 00:13:01,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:13:01,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7760106] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:01,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:13:01,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-01-10 00:13:01,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472946292] [2022-01-10 00:13:01,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:01,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:01,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:01,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:01,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:13:01,341 INFO L87 Difference]: Start difference. First operand 2318 states and 2622 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:01,747 INFO L93 Difference]: Finished difference Result 4812 states and 5533 transitions. [2022-01-10 00:13:01,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:01,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 385 [2022-01-10 00:13:01,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:01,757 INFO L225 Difference]: With dead ends: 4812 [2022-01-10 00:13:01,757 INFO L226 Difference]: Without dead ends: 2674 [2022-01-10 00:13:01,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:13:01,760 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 123 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:01,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 224 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:13:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2022-01-10 00:13:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2674. [2022-01-10 00:13:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.139917695473251) internal successors, (3047), 2673 states have internal predecessors, (3047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3047 transitions. [2022-01-10 00:13:01,807 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3047 transitions. Word has length 385 [2022-01-10 00:13:01,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:01,808 INFO L470 AbstractCegarLoop]: Abstraction has 2674 states and 3047 transitions. [2022-01-10 00:13:01,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3047 transitions. [2022-01-10 00:13:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2022-01-10 00:13:01,816 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:01,817 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:01,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 00:13:02,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:02,031 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:02,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:02,032 INFO L85 PathProgramCache]: Analyzing trace with hash 672820240, now seen corresponding path program 1 times [2022-01-10 00:13:02,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:02,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847978693] [2022-01-10 00:13:02,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:02,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2022-01-10 00:13:02,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:02,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847978693] [2022-01-10 00:13:02,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847978693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:02,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:13:02,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:13:02,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467587307] [2022-01-10 00:13:02,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:02,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:02,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:02,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:02,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:02,164 INFO L87 Difference]: Start difference. First operand 2674 states and 3047 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:02,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:02,597 INFO L93 Difference]: Finished difference Result 6058 states and 6995 transitions. [2022-01-10 00:13:02,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:02,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 457 [2022-01-10 00:13:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:02,605 INFO L225 Difference]: With dead ends: 6058 [2022-01-10 00:13:02,605 INFO L226 Difference]: Without dead ends: 3564 [2022-01-10 00:13:02,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:02,608 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 121 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:02,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 57 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:13:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2022-01-10 00:13:02,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2022-01-10 00:13:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.1400505192253718) internal successors, (4062), 3563 states have internal predecessors, (4062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 4062 transitions. [2022-01-10 00:13:02,668 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 4062 transitions. Word has length 457 [2022-01-10 00:13:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:02,669 INFO L470 AbstractCegarLoop]: Abstraction has 3564 states and 4062 transitions. [2022-01-10 00:13:02,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 4062 transitions. [2022-01-10 00:13:02,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2022-01-10 00:13:02,678 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:02,678 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:02,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 00:13:02,678 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:02,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:02,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1535481681, now seen corresponding path program 1 times [2022-01-10 00:13:02,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:02,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204550885] [2022-01-10 00:13:02,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:02,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 739 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2022-01-10 00:13:02,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:02,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204550885] [2022-01-10 00:13:02,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204550885] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:02,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:13:02,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:13:02,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821299646] [2022-01-10 00:13:02,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:02,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:13:02,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:02,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:13:02,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:13:02,828 INFO L87 Difference]: Start difference. First operand 3564 states and 4062 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:03,304 INFO L93 Difference]: Finished difference Result 7155 states and 8168 transitions. [2022-01-10 00:13:03,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:13:03,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 532 [2022-01-10 00:13:03,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:03,312 INFO L225 Difference]: With dead ends: 7155 [2022-01-10 00:13:03,312 INFO L226 Difference]: Without dead ends: 3742 [2022-01-10 00:13:03,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:13:03,316 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:03,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 17 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:13:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2022-01-10 00:13:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2022-01-10 00:13:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.0940218916643278) internal successors, (3898), 3563 states have internal predecessors, (3898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3898 transitions. [2022-01-10 00:13:03,359 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3898 transitions. Word has length 532 [2022-01-10 00:13:03,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:03,359 INFO L470 AbstractCegarLoop]: Abstraction has 3564 states and 3898 transitions. [2022-01-10 00:13:03,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3898 transitions. [2022-01-10 00:13:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2022-01-10 00:13:03,363 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:03,363 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:03,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 00:13:03,364 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2053013747, now seen corresponding path program 1 times [2022-01-10 00:13:03,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:03,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912476994] [2022-01-10 00:13:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:03,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2022-01-10 00:13:03,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:03,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912476994] [2022-01-10 00:13:03,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912476994] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:13:03,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408358268] [2022-01-10 00:13:03,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:03,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:03,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:13:03,523 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:13:03,547 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:13:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:03,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:13:03,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:13:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2022-01-10 00:13:04,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:13:04,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408358268] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:04,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:13:04,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-01-10 00:13:04,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138358928] [2022-01-10 00:13:04,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:04,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:04,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:04,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:04,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:13:04,549 INFO L87 Difference]: Start difference. First operand 3564 states and 3898 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:04,947 INFO L93 Difference]: Finished difference Result 4634 states and 5054 transitions. [2022-01-10 00:13:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:04,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 540 [2022-01-10 00:13:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:04,962 INFO L225 Difference]: With dead ends: 4634 [2022-01-10 00:13:04,962 INFO L226 Difference]: Without dead ends: 4632 [2022-01-10 00:13:04,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:13:04,964 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 40 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:04,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 11 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:13:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2022-01-10 00:13:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 3742. [2022-01-10 00:13:05,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.0954290296712108) internal successors, (4098), 3741 states have internal predecessors, (4098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4098 transitions. [2022-01-10 00:13:05,026 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4098 transitions. Word has length 540 [2022-01-10 00:13:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:05,027 INFO L470 AbstractCegarLoop]: Abstraction has 3742 states and 4098 transitions. [2022-01-10 00:13:05,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4098 transitions. [2022-01-10 00:13:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2022-01-10 00:13:05,033 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:05,033 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:05,060 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:13:05,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:05,248 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:05,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1324592890, now seen corresponding path program 1 times [2022-01-10 00:13:05,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:05,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414701858] [2022-01-10 00:13:05,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:05,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 943 proven. 11 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2022-01-10 00:13:05,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:05,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414701858] [2022-01-10 00:13:05,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414701858] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:13:05,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131970009] [2022-01-10 00:13:05,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:05,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:05,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:13:05,489 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:13:05,490 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:13:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:05,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:13:05,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:13:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2022-01-10 00:13:06,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:13:06,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131970009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:06,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:13:06,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-01-10 00:13:06,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347330103] [2022-01-10 00:13:06,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:06,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:06,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:06,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:06,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:13:06,370 INFO L87 Difference]: Start difference. First operand 3742 states and 4098 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:06,799 INFO L93 Difference]: Finished difference Result 5168 states and 5627 transitions. [2022-01-10 00:13:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:06,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 587 [2022-01-10 00:13:06,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:06,829 INFO L225 Difference]: With dead ends: 5168 [2022-01-10 00:13:06,829 INFO L226 Difference]: Without dead ends: 5166 [2022-01-10 00:13:06,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:13:06,831 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:06,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 11 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:13:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2022-01-10 00:13:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 3742. [2022-01-10 00:13:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.0954290296712108) internal successors, (4098), 3741 states have internal predecessors, (4098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4098 transitions. [2022-01-10 00:13:06,918 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4098 transitions. Word has length 587 [2022-01-10 00:13:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:06,919 INFO L470 AbstractCegarLoop]: Abstraction has 3742 states and 4098 transitions. [2022-01-10 00:13:06,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4098 transitions. [2022-01-10 00:13:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2022-01-10 00:13:06,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:06,926 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:06,965 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:13:07,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-10 00:13:07,139 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:07,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash 100418186, now seen corresponding path program 1 times [2022-01-10 00:13:07,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:07,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032124816] [2022-01-10 00:13:07,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:07,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 908 proven. 2 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2022-01-10 00:13:07,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:07,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032124816] [2022-01-10 00:13:07,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032124816] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:13:07,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872739934] [2022-01-10 00:13:07,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:07,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:07,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:13:07,316 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:13:07,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 00:13:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:07,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:13:07,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:13:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 989 trivial. 0 not checked. [2022-01-10 00:13:08,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:13:08,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872739934] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:08,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:13:08,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-01-10 00:13:08,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233511969] [2022-01-10 00:13:08,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:08,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:08,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:08,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:08,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:13:08,128 INFO L87 Difference]: Start difference. First operand 3742 states and 4098 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:08,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:08,542 INFO L93 Difference]: Finished difference Result 8192 states and 9025 transitions. [2022-01-10 00:13:08,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:08,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 594 [2022-01-10 00:13:08,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:08,543 INFO L225 Difference]: With dead ends: 8192 [2022-01-10 00:13:08,543 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 00:13:08,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:13:08,548 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 130 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:08,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 212 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:13:08,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 00:13:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 00:13:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 00:13:08,549 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 594 [2022-01-10 00:13:08,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:08,549 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 00:13:08,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:13:08,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 00:13:08,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 00:13:08,551 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 00:13:08,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 00:13:08,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:08,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 00:13:09,346 INFO L858 garLoopResultBuilder]: For program point L762(lines 762 880) no Hoare annotation was computed. [2022-01-10 00:13:09,346 INFO L858 garLoopResultBuilder]: For program point L895(line 895) no Hoare annotation was computed. [2022-01-10 00:13:09,346 INFO L858 garLoopResultBuilder]: For program point L829(lines 829 880) no Hoare annotation was computed. [2022-01-10 00:13:09,346 INFO L858 garLoopResultBuilder]: For program point L631(lines 631 880) no Hoare annotation was computed. [2022-01-10 00:13:09,346 INFO L858 garLoopResultBuilder]: For program point L565(lines 565 880) no Hoare annotation was computed. [2022-01-10 00:13:09,346 INFO L858 garLoopResultBuilder]: For program point L169-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,346 INFO L858 garLoopResultBuilder]: For program point L103-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,346 INFO L858 garLoopResultBuilder]: For program point L37-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,346 INFO L858 garLoopResultBuilder]: For program point L698(lines 698 880) no Hoare annotation was computed. [2022-01-10 00:13:09,346 INFO L858 garLoopResultBuilder]: For program point L500(lines 500 880) no Hoare annotation was computed. [2022-01-10 00:13:09,346 INFO L858 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed. [2022-01-10 00:13:09,346 INFO L858 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-01-10 00:13:09,346 INFO L858 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L369(lines 369 880) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 880) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L436(lines 436 880) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L172-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L106-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L40-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 880) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L768(lines 768 880) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L636(lines 636 880) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L835(lines 835 880) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L571(lines 571 880) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L505(lines 505 880) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L175-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L109-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L43-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L704(lines 704 880) no Hoare annotation was computed. [2022-01-10 00:13:09,347 INFO L858 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 880) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L442(lines 442 880) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L376(lines 376 880) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L178-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L112-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L46-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L245(lines 245 880) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L774(lines 774 880) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L642(lines 642 880) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L510(lines 510 880) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L841(lines 841 880) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L181-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L115-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,348 INFO L858 garLoopResultBuilder]: For program point L49-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L710(lines 710 880) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L578(lines 578 880) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L182(line 182) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 880) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L448(lines 448 880) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 880) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L184-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L118-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L52-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L251(lines 251 880) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L119(line 119) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L648(lines 648 880) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L516(lines 516 880) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L847(lines 847 880) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L781(lines 781 880) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L583(lines 583 880) no Hoare annotation was computed. [2022-01-10 00:13:09,349 INFO L858 garLoopResultBuilder]: For program point L187-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L121-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L55-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L716(lines 716 880) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L321(lines 321 880) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 880) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 880) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L190-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L124-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L58-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L257(lines 257 880) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L191(line 191) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-01-10 00:13:09,350 INFO L858 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L852(lines 852 880) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L654(lines 654 880) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L522(lines 522 880) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L787(lines 787 880) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L589(lines 589 880) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L193-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L127-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L61-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L722(lines 722 880) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L459(lines 459 880) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L327(lines 327 880) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 880) no Hoare annotation was computed. [2022-01-10 00:13:09,351 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 880) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point L196-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point L130-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point L64-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point L197(line 197) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point L858(lines 858 880) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 197) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point L660(lines 660 880) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point L528(lines 528 880) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point L793(lines 793 880) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 880) no Hoare annotation was computed. [2022-01-10 00:13:09,352 INFO L858 garLoopResultBuilder]: For program point L199-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L133-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L728(lines 728 880) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L464(lines 464 880) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L200(line 200) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L333(lines 333 880) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 880) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 880) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L202-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L136-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L70-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-01-10 00:13:09,353 INFO L858 garLoopResultBuilder]: For program point L864(lines 864 880) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L666(lines 666 880) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L534(lines 534 880) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L799(lines 799 880) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L601(lines 601 880) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L205-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L139-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L73-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L734(lines 734 880) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L470(lines 470 880) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L206(line 206) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 880) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 880) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L274(lines 274 880) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L208-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L142-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,354 INFO L858 garLoopResultBuilder]: For program point L76-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L869(lines 869 880) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L209(line 209) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L672(lines 672 880) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 880) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L805(lines 805 880) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L607(lines 607 880) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L211-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L145-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L79-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L740(lines 740 880) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 880) no Hoare annotation was computed. [2022-01-10 00:13:09,355 INFO L858 garLoopResultBuilder]: For program point L345(lines 345 880) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L279(lines 279 880) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L412(lines 412 880) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L148-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L82-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L875(lines 875 880) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L678(lines 678 880) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L546(lines 546 880) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L811(lines 811 880) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L745(lines 745 880) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L613(lines 613 880) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L151-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L85-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point L482(lines 482 880) no Hoare annotation was computed. [2022-01-10 00:13:09,356 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 00:13:09,357 INFO L858 garLoopResultBuilder]: For program point L152(line 152) no Hoare annotation was computed. [2022-01-10 00:13:09,357 INFO L858 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-01-10 00:13:09,357 INFO L858 garLoopResultBuilder]: For program point L351(lines 351 880) no Hoare annotation was computed. [2022-01-10 00:13:09,357 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 880) no Hoare annotation was computed. [2022-01-10 00:13:09,357 INFO L858 garLoopResultBuilder]: For program point L418(lines 418 880) no Hoare annotation was computed. [2022-01-10 00:13:09,357 INFO L858 garLoopResultBuilder]: For program point L154-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,357 INFO L858 garLoopResultBuilder]: For program point L88-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,357 INFO L854 garLoopResultBuilder]: At program point L881(lines 30 882) the Hoare annotation is: (let ((.cse0 (= ~a24~0 1)) (.cse1 (<= ~a21~0 7))) (or (and (<= 7 ~a15~0) .cse0) (and (<= 9 ~a21~0) .cse0) (and .cse0 (< 11 ~a12~0)) (and (<= (+ ~a12~0 43) 0) (<= ~a15~0 8) .cse1) (and .cse0 .cse1))) [2022-01-10 00:13:09,357 INFO L858 garLoopResultBuilder]: For program point L551(lines 551 880) no Hoare annotation was computed. [2022-01-10 00:13:09,357 INFO L858 garLoopResultBuilder]: For program point L221(lines 221 880) no Hoare annotation was computed. [2022-01-10 00:13:09,357 INFO L858 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-01-10 00:13:09,357 INFO L858 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-01-10 00:13:09,358 INFO L858 garLoopResultBuilder]: For program point L684(lines 684 880) no Hoare annotation was computed. [2022-01-10 00:13:09,358 INFO L858 garLoopResultBuilder]: For program point L817(lines 817 880) no Hoare annotation was computed. [2022-01-10 00:13:09,358 INFO L858 garLoopResultBuilder]: For program point L751(lines 751 880) no Hoare annotation was computed. [2022-01-10 00:13:09,358 INFO L858 garLoopResultBuilder]: For program point L619(lines 619 880) no Hoare annotation was computed. [2022-01-10 00:13:09,358 INFO L858 garLoopResultBuilder]: For program point L157-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,358 INFO L858 garLoopResultBuilder]: For program point L91-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,358 INFO L861 garLoopResultBuilder]: At program point L884(lines 884 900) the Hoare annotation is: true [2022-01-10 00:13:09,358 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 880) no Hoare annotation was computed. [2022-01-10 00:13:09,358 INFO L858 garLoopResultBuilder]: For program point L290(lines 290 880) no Hoare annotation was computed. [2022-01-10 00:13:09,366 INFO L858 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed. [2022-01-10 00:13:09,366 INFO L858 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2022-01-10 00:13:09,366 INFO L858 garLoopResultBuilder]: For program point L687(lines 687 880) no Hoare annotation was computed. [2022-01-10 00:13:09,366 INFO L858 garLoopResultBuilder]: For program point L357(lines 357 880) no Hoare annotation was computed. [2022-01-10 00:13:09,366 INFO L858 garLoopResultBuilder]: For program point L424(lines 424 880) no Hoare annotation was computed. [2022-01-10 00:13:09,366 INFO L858 garLoopResultBuilder]: For program point L160-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,366 INFO L858 garLoopResultBuilder]: For program point L94-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,367 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 00:13:09,367 INFO L858 garLoopResultBuilder]: For program point L557(lines 557 880) no Hoare annotation was computed. [2022-01-10 00:13:09,367 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 880) no Hoare annotation was computed. [2022-01-10 00:13:09,367 INFO L858 garLoopResultBuilder]: For program point L161(line 161) no Hoare annotation was computed. [2022-01-10 00:13:09,367 INFO L858 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2022-01-10 00:13:09,367 INFO L858 garLoopResultBuilder]: For program point L757(lines 757 880) no Hoare annotation was computed. [2022-01-10 00:13:09,367 INFO L858 garLoopResultBuilder]: For program point L625(lines 625 880) no Hoare annotation was computed. [2022-01-10 00:13:09,367 INFO L858 garLoopResultBuilder]: For program point L163-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,367 INFO L858 garLoopResultBuilder]: For program point L97-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,367 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 33) no Hoare annotation was computed. [2022-01-10 00:13:09,367 INFO L858 garLoopResultBuilder]: For program point L31-2(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,367 INFO L858 garLoopResultBuilder]: For program point L824(lines 824 880) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L854 garLoopResultBuilder]: At program point L890-2(lines 890 899) the Hoare annotation is: (let ((.cse0 (= ~a24~0 1)) (.cse1 (<= ~a21~0 7))) (or (and (<= 7 ~a15~0) .cse0) (and (<= 9 ~a21~0) .cse0) (and .cse0 (< 11 ~a12~0)) (and (<= (+ ~a12~0 43) 0) (<= ~a15~0 8) .cse1) (and .cse0 .cse1))) [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L494(lines 494 880) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 880) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L693(lines 693 880) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 880) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L562(lines 562 880) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L430(lines 430 880) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L166-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L100-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L34-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L233(lines 233 880) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L167(line 167) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2022-01-10 00:13:09,368 INFO L858 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-01-10 00:13:09,371 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:09,374 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 00:13:09,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:13:09 BoogieIcfgContainer [2022-01-10 00:13:09,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 00:13:09,394 INFO L158 Benchmark]: Toolchain (without parser) took 16995.13ms. Allocated memory was 217.1MB in the beginning and 352.3MB in the end (delta: 135.3MB). Free memory was 164.7MB in the beginning and 314.3MB in the end (delta: -149.6MB). Peak memory consumption was 193.9MB. Max. memory is 8.0GB. [2022-01-10 00:13:09,394 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 217.1MB. Free memory was 183.2MB in the beginning and 183.1MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:13:09,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.89ms. Allocated memory is still 217.1MB. Free memory was 164.5MB in the beginning and 172.0MB in the end (delta: -7.5MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-01-10 00:13:09,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.59ms. Allocated memory is still 217.1MB. Free memory was 172.0MB in the beginning and 162.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 00:13:09,396 INFO L158 Benchmark]: Boogie Preprocessor took 74.54ms. Allocated memory is still 217.1MB. Free memory was 162.6MB in the beginning and 156.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-10 00:13:09,396 INFO L158 Benchmark]: RCFGBuilder took 988.43ms. Allocated memory is still 217.1MB. Free memory was 156.8MB in the beginning and 80.8MB in the end (delta: 76.0MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. [2022-01-10 00:13:09,396 INFO L158 Benchmark]: TraceAbstraction took 15411.00ms. Allocated memory was 217.1MB in the beginning and 352.3MB in the end (delta: 135.3MB). Free memory was 80.3MB in the beginning and 314.3MB in the end (delta: -234.0MB). Peak memory consumption was 109.9MB. Max. memory is 8.0GB. [2022-01-10 00:13:09,398 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.13ms. Allocated memory is still 217.1MB. Free memory was 183.2MB in the beginning and 183.1MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 436.89ms. Allocated memory is still 217.1MB. Free memory was 164.5MB in the beginning and 172.0MB in the end (delta: -7.5MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.59ms. Allocated memory is still 217.1MB. Free memory was 172.0MB in the beginning and 162.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.54ms. Allocated memory is still 217.1MB. Free memory was 162.6MB in the beginning and 156.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 988.43ms. Allocated memory is still 217.1MB. Free memory was 156.8MB in the beginning and 80.8MB in the end (delta: 76.0MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15411.00ms. Allocated memory was 217.1MB in the beginning and 352.3MB in the end (delta: 135.3MB). Free memory was 80.3MB in the beginning and 314.3MB in the end (delta: -234.0MB). Peak memory consumption was 109.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 197]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1806 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1806 mSDsluCounter, 1198 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 922 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6915 IncrementalHoareTripleChecker+Invalid, 7837 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 922 mSolverCounterUnsat, 1128 mSDtfsCounter, 6915 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2656 GetRequests, 2623 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3742occurred in iteration=11, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 3026 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 61 NumberOfFragments, 83 HoareAnnotationTreeSize, 3 FomulaSimplifications, 586 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1976 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 7377 NumberOfCodeBlocks, 7377 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 7358 ConstructedInterpolants, 0 QuantifiedInterpolants, 34302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3449 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 11453/11996 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((7 <= a15 && a24 == 1) || (9 <= a21 && a24 == 1)) || (a24 == 1 && 11 < a12)) || ((a12 + 43 <= 0 && a15 <= 8) && a21 <= 7)) || (a24 == 1 && a21 <= 7) - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((((7 <= a15 && a24 == 1) || (9 <= a21 && a24 == 1)) || (a24 == 1 && 11 < a12)) || ((a12 + 43 <= 0 && a15 <= 8) && a21 <= 7)) || (a24 == 1 && a21 <= 7) RESULT: Ultimate proved your program to be correct! [2022-01-10 00:13:09,437 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...